#include<bits/stdc++.h>
#include<vector>
#include<numeric>
using namespace std;
struct node
{
	double time;
	int no;
};
 inline bool cmp(node a,node b)
{
	return a.time<b.time;
}
int main()
{
	int n;
	double sum1=0;
	double x,y;
	
		double sum=0;
	vector<node>a;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>x;
		node c={x,i};
		a.push_back(c);
		
	}
	
	sort(a.begin(),a.end(),cmp);
	
	sum=0;
 for(int i= 1; i<=n;i++)
 {
 	  cout<<a[i].no<<" ";
 		sum+=(a[i].time)*(n-i);
 	
	 
 }
	printf("\n%.2lf",double(sum)/a.size());
	return 0;}

CSDN随便一搜一个几乎完全一样的就能AC我这个全红是为啥