点链接查看答案 链接描述

#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #include<iomanip> using namespace std; struct peo{ int time; int id; }; bool cmp(peo a,peo b){ return a.time<b.time; } int main() { int n; peo s[1001]; double t=0; cin>>n; for(int i=0;i<n;i++){ cin>>s[i].time; s[i].id=i+1; } sort(s,s+n,cmp); for(int i=0;i<n;i++){ if(i!=n-1){ cout<<s[i].id<<" "; } else{ cout<<s[i].id; } t+=(n-i-1)*s[i].time; } cout<<endl; printf("%.2f",t/n); return 0; }

Code: Hope you like it! Please give a thumbs up.

#include<bits/stdc++.h> using namespace std; struct P{ int tim,id; }p[1005]; bool cmp(P a,P b){ return a.tim<b.tim; } int n; double sum; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].tim; p[i].id=i; } sort(p+1,p+n+1,cmp); for(int i=1;i<=n;i++){ sum+=p[i].tim*(n-i); cout<<p[i].id<<" "; } cout<<endl; printf("%.2lf",sum/n); return 0; }

#include <bits/stdc++.h> using namespace std; int n; double ans = 0; struct water{ int time , id; }a[1009]; bool cmp(water x , water y){ return x.time < y.time; } int main(){ cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i].time; a[i].id = i; } sort(a + 1 , a + n + 1 , cmp); for(int i = 1; i <= n; i++){ cout << a[i].id << ' '; ans += a[i].time * (n - i); } printf("\n%.2f" , ans / n); return 0; }

#include <bits/stdc++.h> using namespace std; struct Person { int id; int time; }; bool compare(const Person &a, const Person &b) { return a.time < b.time; } int main() { int n; cin >> n; vector<Person> people(n); for (int i = 0; i < n; ++i) { cin >> people[i].time; people[i].id = i + 1; } sort(people.begin(), people.end(), compare); vector<int> order(n); vector<int> waitTimes(n); int totalWaitTime=0; int currentTime=0; for (int i = 0; i < n; ++i) { order[i] = people[i].id; waitTimes[i] = currentTime; totalWaitTime += currentTime; currentTime += people[i].time; } double averageWaitTime = static_cast<double>(totalWaitTime) / n; for (int i = 0; i < n; ++i) { cout << order[i]; if (i != n - 1) { cout << " "; } } cout << endl; cout << fixed << setprecision(2) << averageWaitTime << endl; return 0; }

#include<bits/stdc++.h> using namespace std; struct stu{ int id,ti; }; stu a[1005]; int n,ans; bool cmp(stu a,stu b){ return a.ti<b.ti; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].ti; a[i].id=i; } sort(a+1,a+1+n,cmp); for(int i=1;i<=n;i++){ cout<<a[i].id<<" "; ans+=(n-i)a[i].ti; } cout<<endl; printf("%.2f",ans1.0/n); return 0; }