AcWing 429. 奖学金
原题链接
简单
作者:
可持久化WA自动机
,
2021-01-17 08:59:17
,
所有人可见
,
阅读 410
算法1
(快排) $O(n*logn)$
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<string>
#include<cstring>
#include<bitset>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<iomanip>
#include<algorithm>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define PI acos(-1)
//CLOCKS_PER_SEC clock()函数每秒执行次数
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 3e5+5;
int mod = 1e9 +7;
int n,m,k;
struct node{
int total,chinese,id;
}e[maxn];
bool cmp(node a,node b){
if(a.total != b.total) return a.total > b.total;
if(a.chinese != b.chinese) return a.chinese > b.chinese;
return a.id < b.id;
}
void solve(){
cin >> n;
for(int i = 1 ; i <= n ; ++i ){
int a,b,c;
cin >> a >> b >> c;
e[i] = {a + b + c,a,i};
}
sort(e + 1,e + 1 + n,cmp);
for(int i = 1 ; i <= 5 ; ++i ) cout << e[i].id << ' ' << e[i].total << endl;
}
signed main(){
IOS;
solve();
return 0;
}
/*
*
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/