Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
3335 | 邓程允 | 奖学金 | C++ | Wrong Answer | 2 MS | 328 KB | 697 | 2024-05-18 11:52:00 |
# include<iostream> # include<algorithm> using namespace std; struct Student{ int id; int Ch; int Ma; int En; void input(){ cin>>Ch>>Ma>>En; } int zf(){ return Ch+Ma+En; } }; Student s[101]; bool cmp(Student a,Student b){ if(a.zf()!=b.zf())return a.zf()>b.zf(); if(a.zf()==b.zf() && a.Ch>b.Ch)return a.Ch>b.Ch; if(a.zf()==b.zf() && a.Ch==b.Ch)return a.id>b.id; } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ s[i].id=i; cin>>s[i].Ch>>s[i].Ma>>s[i].En; } sort(s,s+5,cmp); for(int i=1;i<=5;i++){ cout<<s[i].id<<" "<<s[i].zf()<<endl; } return 0; }
------Input------
118 12 28 82 9 52 37 56 84 13 19 88 44 20 75 6 88 98 33 61 69 21 59 37 81 29 98 24 21 55 3 37 57 40 71 90 56 80 53 73 2 62 12 0 17 100 19 0 94 20 20 23 24 78 82 90 84 56 53 53 69 0 85 96 69 74 40 83 9 77 76 88 70 38 60 54 41 72 3 75 80 83 64 6 51 57 83 98 47 21 66 80 63 41 55 94 42 65 41 76 97 89 39 59 39 0 15 18 14 90 16 85 7 97 54 47 48 17 46 38 20 40 19 19 9 67 22 24 13 72 95 74 0 90 58 10 0 35 69 11 8 24 45 24 45 96 27 19 27 36 58 29 34 65 22 36 29 11 80 71 69 75 24 42 61 57 69 82 94 63 25 8
------Answer-----
56 245 27 238 29 238 24 234 73 231
------Your output-----