-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpat 1012.cpp
73 lines (69 loc) · 2.01 KB
/
pat 1012.cpp
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
#include <stdio.h>
#include <stdlib.h>
typedef struct stu
{
int flag;
int c;
int m;
int e;
int a;
}stu;
stu student[1000000]={0};
int a[102]={0},c[102]={0},m[102]={0},e[102]={0};
int ra[102]={0},rc[102]={0},rm[102]={0},re[102]={0};
int main()
{
int N,M,i,id,min;
char s;
scanf("%d %d",&N,&M);
for( i = 0; i < N; i++)
{
scanf("%d",&id);
student[id].flag=1;
scanf("%d%d%d",&student[id].c,&student[id].m,&student[id].e);
student[id].a = ( student[id].c + student[id].m + student[id].e) / 3;
a[student[id].a]++;
c[student[id].c]++;
m[student[id].m]++;
e[student[id].e]++;
}
for(i = 100; i >=0 ; i--)
{
a[i]+=a[i+1];
ra[i]=a[i+1]+1;
c[i]+=c[i+1];
rc[i]=c[i+1]+1;
e[i]+=e[i+1];
re[i]=e[i+1]+1;
m[i]+=m[i+1];
rm[i]=m[i+1]+1;
}
for( i = 0; i < M; i++)
{
scanf("%d",&id);
if(student[id].flag==0)
printf("N/A\n");
else
{
s='A';
min=ra[student[id].a];
if(rc[student[id].c]<min)
{
min=rc[student[id].c];
s='C';
}
if(rm[student[id].m]<min)
{
min=rm[student[id].m];
s='M';
}
if(re[student[id].e]<min)
{
min=re[student[id].e];
s='E';
}
printf("%d %c\n",min,s);
}
}
return 0;
}