pat甲级1012前两个测试点一直通过不了。怎么破?
题目描述
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
我的代码:
#include <iostream>
#include <string.h>
using namespace std;
struct stu
{
string num; //学号
int c; //c成绩
int m; //m成绩
int e; //e成绩
int a; //平均成绩
int best; //最好成绩
int bs; //最好科目
int bR = 1; //best rank
}list[2000];
int main ()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
int tmax = 0; //暂存最大数
//int bs;
cin >> list[i].num;
cin >> list[i].c;
if (list[i].c > tmax)
{
tmax = list[i].c;
list[i].bs = 1;
}
cin >> list[i].m;
if (list[i].m > tmax)
{
tmax = list[i].m;
list[i].bs = 2;
}
cin >> list[i].e;
if (list[i].e > tmax)
{
tmax = list[i].e;
list[i].bs = 3;
}
list[i].a = int((list[i].c + list[i].m + list[i].e) / 3.0 + 0.5);
if (list[i].a >= tmax)
{
tmax = list[i].a;
list[i].bs = 4;
}
list[i].best = tmax;
}
for (int i = 0; i < m; i++)
{
int flag = 0;
string cn; //需要检测的学号
cin >> cn;
for (int j = 0; j < n; j++)
{
if (cn == list[j].num)
{
int b = list[j].best; //最好成绩
int s = list[j].bs; //最好的科目
char c;
if (s == 1)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].c > b)
list[j].bR += 1;
}
c = 'C';
}
if (s == 2)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].m > b)
list[j].bR += 1;
}
c = 'M';
}
if (s == 3)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].e > b)
list[j].bR += 1;
}
c = 'E';
}
if (s == 4)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].a > b)
list[j].bR += 1;
}
c = 'A';
}
cout << list[j].bR << ' ' << c << endl;
flag = 1;
break;
}
}
if (!flag)
cout << "N/A" << endl;
}
}
测试结果:

有大佬指导一下我吗
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
我的代码:
#include <iostream>
#include <string.h>
using namespace std;
struct stu
{
string num; //学号
int c; //c成绩
int m; //m成绩
int e; //e成绩
int a; //平均成绩
int best; //最好成绩
int bs; //最好科目
int bR = 1; //best rank
}list[2000];
int main ()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
int tmax = 0; //暂存最大数
//int bs;
cin >> list[i].num;
cin >> list[i].c;
if (list[i].c > tmax)
{
tmax = list[i].c;
list[i].bs = 1;
}
cin >> list[i].m;
if (list[i].m > tmax)
{
tmax = list[i].m;
list[i].bs = 2;
}
cin >> list[i].e;
if (list[i].e > tmax)
{
tmax = list[i].e;
list[i].bs = 3;
}
list[i].a = int((list[i].c + list[i].m + list[i].e) / 3.0 + 0.5);
if (list[i].a >= tmax)
{
tmax = list[i].a;
list[i].bs = 4;
}
list[i].best = tmax;
}
for (int i = 0; i < m; i++)
{
int flag = 0;
string cn; //需要检测的学号
cin >> cn;
for (int j = 0; j < n; j++)
{
if (cn == list[j].num)
{
int b = list[j].best; //最好成绩
int s = list[j].bs; //最好的科目
char c;
if (s == 1)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].c > b)
list[j].bR += 1;
}
c = 'C';
}
if (s == 2)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].m > b)
list[j].bR += 1;
}
c = 'M';
}
if (s == 3)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].e > b)
list[j].bR += 1;
}
c = 'E';
}
if (s == 4)
{
for (int k = 0; k < n; k++)
{
if (j != k && list[k].a > b)
list[j].bR += 1;
}
c = 'A';
}
cout << list[j].bR << ' ' << c << endl;
flag = 1;
break;
}
}
if (!flag)
cout << "N/A" << endl;
}
}
测试结果:

有大佬指导一下我吗
...全文
相关推荐
PAT 甲级 1003-1013代码
标题中的"PAT 甲级 1003-1013代码"表明这是一个与PAT(Pacific Asia Testing for Computer Science Education)甲级编程竞赛相关的资源包。
【PAT-B1012】数字分类——c++满分题解(csdn)————程序.pdf
【PAT-B1012】数字分类是一道编程题目,主要考察了C++语言的条件判断、循环控制、数组操作以及数值处理能力。
1012 数字分类 (20 point(s)).cpp
1012 数字分类 (20 point(s)),AC代码,欢迎想考PAT的童鞋们观看
PAT答案_1001至1049
**pat1012.cpp**:此题可能与排序算法有关,比如快速排序、归并排序或者插入排序。PAT常测试对各种排序算法的理解和实现。3. **pat1016.cpp**:可能是关于动态规划的问题。
pat顶级和leetcode-PAT-Basic-Level:个人准备的PAT乙级考试
pat顶级和leetcodePAT-Basic-Level个人准备的PAT乙级考试不定期更新,用空就来刷刷题。。。更新日志:时间题目17.5.91026.cpp1046.cpp17.5.131004.


新手乐园
