54分代码求条

#include<iostream> 
#include<cstdio>
#include<algorithm>
#include<iomanip>
using namespace std;

struct paidui{
	int t;
	int id;
}dui[1000013];
bool cmp(paidui a,paidui b){
	return a.t<b.t;
}

int main(){
	int n;
	float sum=0.00;
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>dui[i].t;
		dui[i].id=i;
	}
	sort(dui+1,dui+1+n,cmp);
	for (int i=1;i<=n;i++){
		cout<<dui[i].id<<' ';
	}
	cout<<'\n';
	for (int i=2;i<n;i++){
		dui[i].t+=dui[i-1].t;
	}
	for (int i=1;i<n;i++){
		sum+=dui[i].t;
	}
	float p=sum/n;
	cout<<fixed<<setprecision(2)<<p<<'\n';
	
	return 0;
}