Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
49081 | 陈梓睿 | 奖学金 | C++ | Accepted | 1 MS | 272 KB | 985 | 2023-06-23 09:38:21 |
#include<iostream> using namespace std; struct chengji{ int xh; int zf; int yw; int sx; int yy; }cj[301]; bool bijiao(chengji a,chengji b){ if(a.zf<b.zf){ return true; } else if(a.zf==b.zf){ if(a.yw<b.yw){ return true; } else if(a.yw==b.yw){ if(a.xh>b.xh){ return true; } } } return false; } int main(){ int n; cin>>n; chengji s; for(int i = 0;i<n;i++){ cj[i].xh = i+1; cin>>cj[i].yw>>cj[i].sx>>cj[i].yy; cj[i].zf = cj[i].yw+cj[i].sx+cj[i].yy; } for(int i = 0;i<n;i++){ for(int k = 0;k<n-i-1;k++){ if(bijiao(cj[k],cj[k+1])){ s = cj[k]; cj[k] = cj[k+1]; cj[k+1] = s; } } } for(int i = 0;i<5;i++){ cout<<cj[i].xh<<" "<<cj[i].zf<<endl; } return 0; }