#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>
#define INF 0x3f3f3f3f
#define eps 1e-6
typedef long long LL;
const double pi = acos(-1.0);
const double delta = 1e-9;
const long long mod = 1e9 + 7;
using namespace std;
struct data
{
string name;
int num;
int time;
}p[10005];
bool cmp(const data &a,const data &b)
{
if(a.num == b.num)
return a.time < b.time;
return a.num > b.num;
}
int main()
{
//freopen("int.txt","r",stdin);
//freopen("out.txt","w",stdout);
int T;
scanf("%d",&T);
for(int i = 0;i < T;i++)
{
p[i].num = p[i].time = 0;
cin >> p[i].name;
int a,b;
for(int j = 0;j < 4;j++)
{
scanf("%d %d",&a,&b);
if(b != 0)
{
p[i].time += (a - 1) * 20 + b;
p[i].num++;
}
}
}
sort(p,p + T,cmp);
cout << p[0].name;
printf(" %d %d\n",p[0].num,p[0].time);
return 0;
}
ZOJ1764 A Contesting Decision
最新推荐文章于 2021-02-18 17:50:20 发布