patjia/1012.cpp at master · ninisy/patjia · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
bool cmp1(double a,double b){
	return a>b;
}
int main(){
	int n,m;
	cin>>n>>m;
	string *id = new string [n];
	int *C = new int[n],*M = new int [n],*E = new int[n];
	int *CC = new int[n],*MM = new int [n],*EE = new int[n];
	double *A = new double[n],*AA = new double[n];
	for(int i=0;i<n;i++){
		cin>>id[i]>>C[i]>>M[i]>>E[i];
		A[i] = (C[i]+M[i]+E[i])/3.0;
		CC[i]=C[i];MM[i]=M[i];EE[i]=E[i];AA[i]=A[i];
	}
	sort(CC,CC+n,cmp);
	sort(MM,MM+n,cmp);
	sort(EE,EE+n,cmp);
	sort(AA,AA+n,cmp1);
	string idd;
	for(int i = 0;i<m;i++){
		cin>>idd;
		int rc=0,rm=0,re=0,ra=0,mmin = 2001;
		bool flag = false;
		for(int j =0;j<n;j++){
			if(idd.compare(id[j])==0){
				for(int l = 0;l<n;l++){
					if(C[j]==CC[l]){
						rc = l+1;
						if(mmin>rc)
							mmin = rc;
						break;
					}
				}
				for(int l = 0;l<n;l++){
					if(M[j]==MM[l]){
						rm = l+1;
						if(mmin>rm)
							mmin = rm;
						break;
					}
				}
				for(int l = 0;l<n;l++){
					if(E[j]==EE[l]){
						re = l+1;
						if(mmin>re)
							mmin = re;
						break;
					}
				}
				for(int l = 0;l<n;l++){
					if(A[j]==AA[l]){
						ra = l+1;
						if(mmin>ra)
							mmin = ra;
						break;
					}
				}

			flag = true;
			break;
			}else
				continue;
		}
		if(!flag)
			cout<<"N/A"<<endl;
		else{
			if(ra==mmin){
				cout<<mmin<<" "<<"A"<<endl;
				continue;
			}
			else if(rc==mmin){
				cout<<mmin<<" "<<"C"<<endl;
				continue;
			}
			else if(rm==mmin){
				cout<<mmin<<" "<<"M"<<endl;
				continue;
			}
			else{
				cout<<mmin<<" "<<"E"<<endl;
				continue;
			}
		}
	}
	system("pause");
	return 0;

}