patpat/pat-1012.cpp at master · LLLLKKKK/patpat · 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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include <iostream>
#include <vector>
using namespace std;
#include<vector>
#include<map>
#include<algorithm>

struct Stu
{
    int id;
    int C;
    int M;
    int E;
    int A;
};

bool sortByC(Stu a,Stu b)
{
    return a.C > b.C;
}

bool sortByM(Stu a,Stu b)
{
    return a.M>b.M;
}

bool sortByE(Stu a,Stu b)
{
    return a.E>b.E;
}

bool sortByA(Stu a,Stu b)
{
    return a.A>b.A;
}

int main()
{
    vector<Stu> v;
    map<int,char> mType;
    map<int,int> mRank;
    int N;
    int M;
    int Q;

    cin>>N;
    cin>>M;

    for(int i=0;i<N;i++)
    {
        Stu s;
        cin>>s.id;
        cin>>s.C;
        cin>>s.M;
        cin>>s.E;
        s.A = (s.C + s.M + s.E)/3;
        v.push_back(s);
    }

    int score=-1;
    int rank=0;
    sort(v.begin(),v.end(),sortByA);
    for(int i=0;i<v.size();i++)
    {
        if(v[i].A!=score)
        {
            rank=i+1;
        }
        score= v[i].A;
        mRank[v[i].id] = rank;
        mType[v[i].id] = 'A';
    }
    score=-1;
    rank=0;
    sort(v.begin(),v.end(),sortByC);
    for(int i=0;i<v.size();i++)
    {
        if(v[i].C!=score)
        {
            rank=i+1;
        }
        score= v[i].C;

        if(mRank[v[i].id]>rank)
        {
            mRank[v[i].id] = rank;
            mType[v[i].id] = 'C';
        }

    }
    score=-1;
    rank=0;
    sort(v.begin(),v.end(),sortByM);
    for(int i=0;i<v.size();i++)
    {
        if(v[i].M!=score)
        {
            rank=i+1;
        }
        score= v[i].M;

        if(mRank[v[i].id]>rank)
        {
            mRank[v[i].id] = rank;
            mType[v[i].id] = 'M';
        }
    }
    score=-1;
    rank=0;
    sort(v.begin(),v.end(),sortByE);
    for(int i=0;i<v.size();i++)
    {
        if(v[i].E!=score)
        {
            rank=i+1;
        }
        score= v[i].E;
        if(mRank[v[i].id]>rank)
        {
            mRank[v[i].id] = rank;
            mType[v[i].id] = 'E';
        }
    }

    for(int i=0;i<M;i++)
    {
        cin>>Q;
        if(mType.count(Q))
            cout<<mRank[Q]<<" "<<mType[Q]<<endl;
        else
            cout<<"N/A"<<endl;
    }

}