The Best Rank (25)（排名算法）

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algebra), and E - English. At the mean time, we encourage students by emphasizing on their best ranks -- that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student.

For example, The grades of C, M, E and A - Average of 4 students are given as the following:

StudentID  C  M  E  A

310101     98 85 88 90

310102     70 95 88 84

310103     82 87 94 88

310104     91 91 91 91

Then the best ranks for all the students are No.1 since the 1st one has done the best in C Programming Language, while the 2nd one in Mathematics, the 3rd one in English, and the last one in average.

Input

Each input file contains one test case. Each case starts with a line containing 2 numbers N and M (<=2000), which are the total number of students, and the number of students who would check their ranks, respectively. Then N lines follow, each contains a student ID which is a string of 6 digits, followed by the three integer grades (in the range of [0, 100]) of that student in the order of C, M and E. Then there are M lines, each containing a student ID.

Output

For each of the M students, print in one line the best rank for him/her, and the symbol of the corresponding rank, separated by a space.

The priorities of the ranking methods are ordered as A > C > M > E. Hence if there are two or more ways for a student to obtain the same best rank, output the one with the highest priority.

If a student is not on the grading list, simply output "N/A".

Sample Input

5 6

310101 98 85 88

310102 70 95 88

310103 82 87 94

310104 91 91 91

310105 85 90 90

310101

310102

310103

310104

310105

999999

Sample Output

1 C

1 M

1 E

1 A

3 A

N/A

排名不应该只是简单的排序算法：

比如说  100，100，99，……   得99分是人是 第二名，而不是第三名。

所以，应该先对分数进行排序，然后在更新名次，算法如下：

      SS[].ra=； //第一个肯定是第一名

          int count=;

          for(i=;i<n;i++)

             {

                   if(SS[i].A==SS[i-].A)//A为平均分

                   {

                       SS[i].ra=SS[i-].ra;//ra 平均分排名

                   count++;//如果分数相同，那么名次和前一个相同，计数器++

                   }

                 else

                     {

                        SS[i].ra=SS[i-].ra+count;

                         count=;//计算器记得还原

                     }

          }

AC代码：

 #include <iostream>

 #include <algorithm>

 #include <string>

 using namespace std;

 struct stu

 {

    string ID;

    int A,C,M,E;

    int ra,rc,rm,re;

 };

 stu SS[];

 bool cmp1(stu a,stu b)

 {

     return a.A>b.A;

 }

 bool cmp2(stu a,stu b)

 {

     return a.C>b.C;

 }

 bool cmp3(stu a,stu b)

 {

     return a.M>b.M;

 }

 bool cmp4(stu a,stu b)

 {

     return a.E>b.E;

 }

 int main()

 {

       int n;

       while(cin>>n)

       {

             int m,i;

          cin>>m;

          for(i=;i<n;i++)

          {

                cin>>SS[i].ID>>SS[i].C>>SS[i].M>>SS[i].E;

          }

           for(i=;i<n;i++)

          {

                 SS[i].A=(SS[i].C+SS[i].M+SS[i].E)/;

                     SS[i].ra=;

                     SS[i].rc=;

                     SS[i].rm=;

                     SS[i].re=;

          }

        sort(SS,SS+n,cmp1);

          int count=;

          for(i=;i<n;i++)

             {

                   if(SS[i].A==SS[i-].A)

                   {

                       SS[i].ra=SS[i-].ra;

                               count++;

                   }

                 else

                     {

                        SS[i].ra=SS[i-].ra+count;

                         count=;

                     }

          }

             sort(SS,SS+n,cmp2);

           count=;

          for(i=;i<n;i++)

          {

              if(SS[i].C==SS[i-].C)

                   {

                       SS[i].rc=SS[i-].rc;

                               count++;

                   }

                 else

                     {

                        SS[i].rc=SS[i-].rc+count;

                         count=;

                     }

          }

             sort(SS,SS+n,cmp3);

          count=;

          for(i=;i<n;i++)

          {

              if(SS[i].M==SS[i-].M)

                   {

                       SS[i].rm=SS[i-].rm;

                               count++;

                   }

                 else

                     {

                        SS[i].rm=SS[i-].rm+count;

                         count=;

                     }

          }

             sort(SS,SS+n,cmp4);

          count=;

          for(i=;i<n;i++)

          {

              if(SS[i].E==SS[i-].E)

                   {

                       SS[i].re=SS[i-].re;

                               count++;

                   }

                 else

                     {

                        SS[i].re=SS[i-].re+count;

                         count=;

                     }

          }

               for(i=;i<m;i++)

          {

                   string goal;int j;

               cin>>goal;

                   for(j=;j<n;j++)

                         if(SS[j].ID==goal) break;

           if(j==n) cout<<"N/A"<<endl;

             else{           

                   char high='E';

                   int temp=SS[j].re;

                   if(temp>=SS[j].rm)

                   {

                      high='M';

                      temp=SS[j].rm;

                   }

                   if(temp>=SS[j].rc)

                   {

                      high='C';

                      temp=SS[j].rc;

                   }

                   if(temp>=SS[j].ra)

                   {

                      high='A';

                      temp=SS[j].ra;

                   }

                   cout<<temp<<" "<<high<<endl;

             }

          }

       }

   return ;

 }