P1223 排队接水

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<math.h>
#include<stdlib.h>
#include <functional>
using namespace std;
struct haha{
   int t;
   int num;
}a[22222];
bool cmp(haha a,haha b){
    if(a.t==b.t)
        return a.num<b.num;
    else
   return a.t<b.t;
}
int main()
{   double x=0,y=0;
    int n,i;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i].t;
        a[i].num=i;
    }
    sort(a+1,a+n+1,cmp);

    for(i=1;i<=n;i++)
    {
        cout<<a[i].num<<' ';
        x+=a[i].t*(n-i);
    }
    printf("\n");
    printf("%.2lf",x/n);
    return 0;
}