1012. The Best Rank (25)

最新推荐文章于 2022-03-02 19:29:24 发布

Ace_XK

最新推荐文章于 2022-03-02 19:29:24 发布

阅读量422

点赞数

分类专栏： PAT 文章标签： pat

本文链接：https://blog.csdn.net/xkzju2010/article/details/46909881

版权

PAT 专栏收录该内容

133 篇文章 0 订阅

订阅专栏

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - CProgramming Language, M - Mathematics (Calculus or Linear Algebra), and E - English. At the mean time, we encouragestudents by emphasizing on their best ranks -- that is, among the four ranks with respect to the three courses and theaverage 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

提交代码

第一次提交的时候，没有在意算平均值的时候的四舍五入问题。

导致下面的错误，第三个测试点无法通过。

修改之后，得到正确的了。

涉及的知识点为，vector的排序。

然后就是名次一样的情况。1 1 1 4.。。。。。。

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define MAX(a,b) (a)>(b)?(a):(b)

struct Stu
{
	string id;
	int C;
	int M;
	int E;
	int A;
	int rank;
	int rankindex;
};

int N,M;
vector<Stu> vstu;
char CN[4][2]={"C","M","E","A"};

bool cmpbya(Stu a, Stu b)
{
	return a.A>b.A;
}
bool cmpbyc(Stu a, Stu b)
{
	return a.C>b.C;
}
bool cmpbym(Stu a, Stu b)
{
	return a.M>b.M;
}
bool cmpbye(Stu a, Stu b)
{
	return a.E>b.E;
}

int findid(string tid)
{
	for(int i=0; i<N; i++)
	{
		if(vstu[i].id==tid)
		{
			return i;
		}
	}
	return -1;
}

int main(int argc, char** argv) {
	scanf("%d %d",&N,&M);
	
	for(int i=0; i<N; i++)
	{
		string tid;
		int tc,tm,te,ta;
		Stu ts;
		cin>>tid>>tc>>tm>>te;
		ta=(int)((tc+tm+te)/3.0+0.5);
		ts.id=tid;
		ts.C=tc;
		ts.M=tm;
		ts.E=te;
		ts.A=ta;
		vstu.push_back(ts);
	}
	
	for(int i=0; i<M; i++)
	{
		string ttid;
		int tmp;Stu tts;
		cin>>ttid;
		tmp=findid(ttid);
		if(tmp == -1)
		{
			printf("N/A\n");
			continue;
		}
		int rank0,rank1,rank2,rank3;
		int j=0;
		sort(vstu.begin(),vstu.end(),cmpbya);
		rank0=tmp=findid(ttid);
		j=tmp-1;
		while(j>=0)
		{
			if(vstu[j].A==vstu[tmp].A)
			{
				rank0=j;
			}
			j--;
		}
		sort(vstu.begin(),vstu.end(),cmpbyc);
		rank1=tmp=findid(ttid);
		j=tmp-1;
		while(j>=0)
		{
			if(vstu[j].C==vstu[tmp].C)
			{
				rank1=j;
			}
			j--;
		}
		sort(vstu.begin(),vstu.end(),cmpbym);
		rank2=tmp=findid(ttid);
		j=tmp-1;
		while(j>=0)
		{
			if(vstu[j].M==vstu[tmp].M)
			{
				rank0=j;
			}
			j--;
		}
		sort(vstu.begin(),vstu.end(),cmpbye);
		rank3=tmp=findid(ttid);
		j=tmp-1;
		while(j>=0)
		{
			if(vstu[j].E==vstu[tmp].E)
			{
				rank3=j;
			}
			j--;
		}
		if ((rank0 <= rank1) && (rank0 <= rank2) && (rank0 <= rank3)){
            cout << rank0+1 << " " << "A" << endl;
        }
        else if ((rank1 < rank0) && (rank1 <= rank2) && (rank1 <= rank3)){
            cout << rank1+1 << " " << "C" << endl;
        }
        else if ((rank2 < rank0) && (rank2 < rank1) && (rank2 <= rank3)){
            cout << rank2+1 << " " << "M" << endl;
        }
        else{
            cout << rank3+1 << " " << "E" << endl;
        }
	}
	
	return 0;
}