#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>
#define maxn 200
using namespace std ;
struct stduct{
string name ;
int qimo_data ;
int piyi_data ;
int a_num ;
int ans ;
int cixv ;
}a[maxn] ;
int n ;
int read () ;
int cmp(stduct x , stduct y) {
if(x.ans == y.ans) return x.cixv < y.cixv ;
return x.ans > y.ans ;
}int sum ;
int main () {
n = read() ;
for(int i = 1 ; i <= n ; i ++) {
a[i].cixv = i ;
cin >> a[i].name >> a[i].qimo_data >> a[i].piyi_data ;
if(a[i].qimo_data > 90) a[i].ans += 2000 ;
if(a[i].qimo_data > 85 && a[i].piyi_data > 80) a[i].ans += 4000 ;
char ch ;cin >> ch ;if(ch == 'Y'&&a[i].piyi_data>80) {
a[i].ans += 850 ;
}
cin >> ch ; if(ch == 'Y'&&a[i].qimo_data > 85) {
a[i].ans += 1000 ;
}
cin >> a[i].a_num ;
if(a[i].a_num&&a[i].qimo_data>80) a[i].ans += 8000 ;
sum += a[i].ans ;
}sort(a+1,a+1+n,cmp) ;
cout << a[1].name <<endl << a[1].ans << endl << sum <<endl ;
return 0 ;
}
int read() {
int x = 0, f = 1 ; char s = getchar () ;
while(s >= '0' && s <= '9') {x = x * 10 + (s - '0') ; s = getchar() ;}
return x*f ;
}
P1051 谁拿了最多奖学金
最新推荐文章于 2019-04-30 09:10:30 发布