sort那CE了，

题

#include<bits/stdc++.h>
#include<algorithm>
#define MAXN 1005
struct node{
	int num;
	int t; 
}a[MAXN];
bool cmp(node a, node b){
	return a.t<b.t;
}
inline int read(){
	int x=0;
	int f=1;
	char ch=getchar();
	while(ch<'0' || ch>'9'){
		if(ch=='-'){
			f=-1;
		}
		ch=getchar();
	}
	while(ch>='0' && ch<='9'){
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return f*x;
}
double ans,sum;//ans平均 sum一共 
int n;
int main(){
	n=read();
	for(int i=1;i<=n;++i){
		a[i].t=read();
		a[i].num=i;
	}
	sort(a+1,a+1+n,cmp);
	cout<<a[1].num<<' ';
	for(int i=2;i<=n;++i){
		cout<<a[i].num<<' ';
		sum+=a[i-1];
	}
	cout<<endl;
	ans=sum/n;
	printf("%.2lf",ans);
	return 0;
}