Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
3293 | 吴奕希 | 奖学金 | C++ | Accepted | 0 MS | 276 KB | 623 | 2024-05-04 18:19:54 |
# include<iostream> # include<algorithm> using namespace std; struct Student{ int c, m, e, id, all; void input(int x){ cin>>c>>m>>e; all = c+m+e; id = x; } void output(){ cout<<id<<" "<<all<<endl; } }; bool cmp(Student s1, Student s2){ if(s1.all==s2.all&&s1.c==s2.c)return s1.id<s2.id; if(s1.all==s2.all)return s1.c>s2.c; return s1.all>s2.all; } struct Student s[300]; int n; int main(){ cin>>n; for(int i = 0; i < n; i++)s[i].input(i+1); sort(s, s+n, cmp); for(int i = 0; i < 5; i++)s[i].output(); return 0; }