poj 1581 [ acm 判题模拟]

#include <iostream>#include <string>#include <cstring>#include <cstdlib>#include <cstdio>#include <cmath>#include <vector>#include <stack>#include <queue>#include <map>#include <set>#include <iterator>#include <algorithm>#define MID(x,y) ( ( x + y ) >> 1 )#define L(x) ( x << 1 )#define R(x) ( x << 1 | 1 )#define BUG puts("here!!!");#define STOP system("pause");using namespace std;const int N = 1005;struct Team {string name;int num;int zt;};Team ren[N];bool cmp(const Team &a, const Team &b) {if(a.num != b.num) {return a.num > b.num;}else {return a.zt < b.zt;}}int main() {int n, ps, pt, zt, num;string name;cin >> n;for(int i = 0; i < n; i++) {zt = 0, num = 0;cin >> name;for(int j = 0; j < 4; j++) {cin >> ps >> pt;if(pt > 0) {num++;zt += (pt + 20 * (ps-1));}}ren[i].name = name;ren[i].num = num;ren[i].zt = zt;}sort(ren, ren + n, cmp);cout << ren[0].name << ' ' << ren[0].num << ' ' << ren[0].zt << endl;return 0;}