4 solutions
-
1
#include<bits/stdc++.h> using namespace std; const int N=310; struct Stu{ int t,y,s,u,i; }; Stu s[N]; bool cmp(Stu a,Stu b) { if(a.t>b.t) return 1; if(a.t==b.t&&a.y>b.y) return 1; if(a.t==b.t&&a.y==b.y&&a.i<b.i) return 1; return 0; } int main() { int n;cin>>n; for(int i=1;i<=n;i++) { cin>>s[i].y>>s[i].s>>s[i].u; s[i].t=s[i].y+s[i].y+s[i].s; } sort(s+1,s+n+1,cmp); for(int i=1;i<=5;i++) { cout<<s[i].i<<" "<<s[i].t<<endl; } return 0; }
Information
- ID
- 945
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 139
- Accepted
- 28
- Uploaded By