【NOIP2007】【Luogu1093】奖学金

problem

solution

codes

//模拟即可
#include<iostream>
#include<algorithm>
using namespace std;
struct node{
    int id, ch, score;
    bool operator < (const node &x)const{
        if(score != x.score)return score > x.score;
        if(ch != x.ch)return ch > x.ch;
        return id < x.id;
    }
}a[310];
int main(){
    int n;  cin>>n;
    for(int i = 1; i <= n; i++){
        a[i].id = i;
        int x, y;  cin>>a[i].ch>>x>>y;
        a[i].score = a[i].ch+x+y;
    }
    sort(a+1,a+n+1);
    for(int i = 1; i <= 5; i++)
        cout<<a[i].id<<" "<<a[i].score<<"\n";
    return 0;
} 
  
 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80587530