0
已解决
中级光能
题目链接： 酷町堂：2927
- #include<bits/stdc++.h> using namespace std; struct q{ int a,m; }b[1005]; int n; double s; int sum,cnt; bool cmp(q x,q y){ if(x.a!=y.a){ return x.a<y.a; }else{ return x.m<y.m; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>b[i].a; b[i].m=i; } sort(b+1,b+n+1,cmp); for(int i=1;i<=n;i++){ cout<<b[i].m<<" "; sum+=cnt; cnt+=b[i].a; } cout<<"\n"; cout<<setprecision(2)<<fixed<<sum/n*1.0; return 0; }
