| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 41293 | jiabokai | 成绩排序 | C++ | Wrong Answer | 1 MS | 252 KB | 413 | 2024-02-20 11:31:14 |
#include<bits/stdc++.h> using namespace std; struct node{ string name; int score; }; bool cmp(node a,node b){ if(a.score!=a.score){ return a.score>b.score; }else return a.name>b.name; } int main() { node s[25]; int n; cin>>n; for(int i=0;i<n;i++){ cin>>s[i].name>>s[i].score; } sort(s,s+n,cmp); for(int i=0;i<n;i++){ cout<<s[i].name<<" "<<s[i].score<<endl; } return 0; }