【打CF，学算法——一星级】CodeForces 74A Room Leader （水题）

【CF简介】

提交链接：CF 74A

题面：

A. Room Leader

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Let us remind you part of the rules of Codeforces. The given rules slightly simplified, use the problem statement as a formal document.

In the beginning of the round the contestants are divided into rooms. Each room contains exactlyn participants. During the contest the participants are suggested to solve five problems,A, B,C, D andE. For each of these problem, depending on when the given problem was solved and whether it was solved at all, the participants receive some points. Besides, a contestant can perform hacks on other contestants. For each successful hack a contestant earns 100 points, for each unsuccessful hack a contestant loses50 points. The number of points for every contestant is represented by the sum of points he has received from all his problems, including hacks.

You are suggested to determine the leader for some room; the leader is a participant who has maximum points.

Input

The first line contains an integer n, which is the number of contestants in the room (1 ≤ n ≤ 50). The nextn lines contain the participants of a given room. Thei-th line has the format of "handle_iplus_iminus_ia_ib_ic_id_ie_i" — it is the handle of a contestant, the number of successful hacks, the number of unsuccessful hacks and the number of points he has received from problemsA, B,C, D,E correspondingly. The handle of each participant consists of Latin letters, digits and underscores and has the length from1 to 20 characters. There are the following limitations imposed upon the numbers:

• 0 ≤ plus_i, minus_i ≤ 50;
• 150 ≤ a_i ≤ 500 ora_i = 0, if problemA is not solved;
• 300 ≤ b_i ≤ 1000 orb_i = 0, if problemB is not solved;
• 450 ≤ c_i ≤ 1500 orc_i = 0, if problemC is not solved;
• 600 ≤ d_i ≤ 2000 ord_i = 0, if problemD is not solved;
• 750 ≤ e_i ≤ 2500 ore_i = 0, if problemE is not solved.

All the numbers are integer. All the participants have different handles. It is guaranteed that there is exactly one leader in the room (i.e. there are no two participants with the maximal number of points).

Output

Print on the single line the handle of the room leader.

Examples

Input

5
Petr 3 1 490 920 1000 1200 0
tourist 2 0 490 950 1100 1400 0
Egor 7 0 480 900 950 0 1000
c00lH4x0R 0 10 150 0 0 0 0
some_participant 2 1 450 720 900 0 0

Output

tourist

Note

The number of points that each participant from the example earns, are as follows:

• Petr — 3860
• tourist — 4140
• Egor — 4030
• c00lH4x0R —  - 350
• some_participant — 2220

Thus, the leader of the room is tourist.

题目大意：

     简化的CF得分规则，按得分排序，输出房间第一。

代码：

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#define sc store[i].score
#define LL long long
using namespace std;
struct per
{
	string name;
	int score;
}store[55];
bool cmp(per a,per b)
{
	return a.score>b.score;
}
int main()
{
	int n,tmp;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>store[i].name;
		cin>>tmp;
		sc=0;		
		sc+=tmp*100;
		cin>>tmp;
		sc-=tmp*50;
		for(int j=0;j<5;j++)
		{
			cin>>tmp;
			sc+=tmp;
		}
	}
	sort(store,store+n,cmp);
	cout<<store[0].name<<endl;
	return 0;
}