A1137. Final Grading

小程序：扫一扫查出行
【扫一扫了解最新限行尾号】
复制小程序

For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain no less than 200 points from the online programming assignments, and then receive a final grade no less than 60 out of 100. The final grade is calculated by G=(Gmid−term×40%+Gfinal×60%) if Gmid−term>Gfinal, or Gfinal will be taken as the final grade G. Here Gmid−term and Gfinal are the student's scores of the mid-term and the final exams, respectively.

The problem is that different exams have different grading sheets. Your job is to write a program to merge all the grading sheets into one.

Input Specification:

Each input file contains one test case. For each case, the first line gives three positive integers: P , the number of students having done the online programming assignments; M, the number of students on the mid-term list; and N, the number of students on the final exam list. All the numbers are no more than 10,000.

Then three blocks follow. The first block contains P online programming scores Gp's; the second one contains M mid-term scores Gmid−term's; and the last one contains N final exam scores Gfinal's. Each score occupies a line with the format: StudentID Score, where StudentID is a string of no more than 20 English letters and digits, and Score is a nonnegative integer (the maximum score of the online programming is 900, and that of the mid-term and final exams is 100).

Output Specification:

For each case, print the list of students who are qualified for certificates. Each student occupies a line with the format:

StudentID Gp Gmid−term Gfinal G

If some score does not exist, output "−" instead. The output must be sorted in descending order of their final grades (G must be rounded up to an integer). If there is a tie, output in ascending order of their StudentID's. It is guaranteed that the StudentID's are all distinct, and there is at least one qullified student.

Sample Input:

6 6 7 01234 880 a1903 199 ydjh2 200 wehu8 300 dx86w 220 missing 400 ydhfu77 99 wehu8 55 ydjh2 98 dx86w 88 a1903 86 01234 39 ydhfu77 88 a1903 66 01234 58 wehu8 84 ydjh2 82 missing 99 dx86w 81

Sample Output:

missing 400 -1 99 99 ydjh2 200 98 82 88 dx86w 220 88 81 84 wehu8 300 55 84 84

#include<iostream>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
typedef struct NODE{
string id;
int Gp, Gm, Gf, G, valid;
NODE(){
Gp = -;
Gm = -;
Gf = -;
}
}info;
map<string, int> mp;
int pt = ;
info stu[];
bool cmp(info a, info b){
if(a.valid != b.valid){
return a.valid > b.valid;
}else{
if(a.G != b.G)
return a.G > b.G;
else{
return a.id < b.id;
}
}
}
int main(){
int P, M, N;
scanf("%d%d%d", &P, &M, &N);
for(int i = ; i < P; i++){
string ss;
int gp, index;
cin >> ss >> gp;
if(mp.count(ss) == ){
mp[ss] = pt++;
index = pt - ;
}else index = mp[ss];
stu[index].Gp = gp;
stu[index].id = ss;
}
for(int i = ; i < M; i++){
string ss;
int mm, index;
cin >> ss >> mm;
if(mp.count(ss) == ){
mp[ss] = pt++;
index = pt - ;
}else index = mp[ss];
stu[index].Gm = mm;
stu[index].id = ss;
}
for(int i = ; i < N; i++){
string ss;
int gn, index;
cin >> ss >> gn;
if(mp.count(ss) == ){
mp[ss] = pt++;
index = pt - ;
}else index = mp[ss];
stu[index].Gf = gn;
stu[index].id = ss;
}
int cnt = ;
for(int i = ; i < pt; i++){
double temp = ;
if(stu[i].Gp < || stu[i].Gf == -){
stu[i].valid = -;
continue;
}
if(stu[i].Gm > stu[i].Gf){
temp = 0.6 * stu[i].Gf + 0.4 * stu[i].Gm + 0.5;
stu[i].G = (int)temp;
}else stu[i].G = stu[i].Gf;
if(stu[i].G >= && stu[i].G <= ){
stu[i].valid = ;
cnt++;
}
else stu[i].valid = -;
}
sort(stu, stu + pt, cmp);
for(int i = ; i < cnt; i++){
cout << stu[i].id << " " << stu[i].Gp << " " << stu[i].Gm << " " << stu[i].Gf << " " << stu[i].G << endl;
}
cin >> N;
return ;
}