简单贪心入门

1319：【例6.1】排队接水

#include<bits/stdc++.h>
using namespace std;
struct node{
	int num;
	int time;
}arr[5000];
bool cmp(node a,node b){
	return a.time<b.time;
}
int main(){
	int n;
	double time_sum=0,time_average;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>arr[i].time;
		arr[i].num=i;
	}
	sort(arr+1,arr+1+n,cmp);
	
	for(int i=1;i<=n;i++){
		cout<<arr[i].num<<" ";
		if(n-i>=1){
			time_sum+=arr[i].time*(n-i);
		}		
	}
	time_average=time_sum/n;
	
	cout<<endl;
	cout<<setiosflags(ios::fixed)<<setprecision(2);
	cout<<time_average<<endl;
	return 0;
}