What Is Your Grade?
2019-07-18 20:33 木木王韦 阅读(120) 评论(0) 收藏 举报“Point, point, life of student!”
This is a ballad(歌谣)well known in colleges, and you must care about your score in this exam too. How many points can you get? Now, I told you the rules which are used in this course.
There are 5 problems in this final exam. And I will give you 100 points if you can solve all 5 problems; of course, it is fairly difficulty for many of you. If you can solve 4 problems, you can also get a high score 95 or 90 (you can get the former(前者) only when your rank is in the first half of all students who solve 4 problems). Analogically(以此类推), you can get 85、80、75、70、65、60. But you will not pass this exam if you solve nothing problem, and I will mark your score with 50.
Note, only 1 student will get the score 95 when 3 students have solved 4 problems.
I wish you all can pass the exam!
Come on!
Input
Input contains multiple test cases. Each test case contains an integer N (1<=N<=100, the number of students) in a line first, and then N lines follow. Each line contains P (0<=P<=5 number of problems that have been solved) and T(consumed time). You can assume that all data are different when 0<p.
A test case starting with a negative integer terminates the input and this test case should not to be processed.
Output
Output the scores of N students in N lines for each case, and there is a blank line after each case.
Sample Input
4
5 06:30:17
4 07:31:27
4 08:12:12
4 05:23:13
1
5 06:30:17
-1
Sample Output
100
90
90
95
100
一开始看错了,写的相同题数的第一个人可以得高分,题意是相同题数前一半可以得高分,把每道题的写对的人数标记一下就可以了,本来写了两个sort,先排时间,后排了题数,第二个是多余的,但是不去掉会wa,原因还是sort反而会使原来的变成乱序,把第二个sort注释掉才过了
#include<iostream>
#include<algorithm>
using namespace std;
struct student{
int answer;
int shi;
int fen;
int miao;
int time;
int score;
int number;
};
bool cmp1(student a,student b){
return a.time <b.time ;
}
bool cmp2(student a,student b){
return a.answer >b.answer ;
}
bool cmp3(student a,student b){
return a.number <b.number ;
}
student stu[200];
int main(){
int t;
while(cin>>t){
if(t<1||t>100) break;
int b[5]={0};
for(int i=0;i<t;i++){
stu[i].number =i;
cin>>stu[i].answer ;
b[stu[i].answer ]++;
scanf("%d:%d:%d",&stu[i].shi,&stu[i].fen ,&stu[i].miao );
stu[i].time =3600*stu[i].shi +60*stu[i].fen +stu[i].miao ;
// cout<<stu[i].answer<<" ";
}
sort(stu,stu+t,cmp1);
// sort(stu,stu+t,cmp2);
int a[5]={0};
int ans=5;
for(int i=0;i<t;i++){
// cout<<stu[i].answer <<" ";
if(stu[i].answer ==5){
stu[i].score =100;
}
else if(stu[i].answer ==4){
if(a[4]<b[4]/2){
stu[i].score =95;
a[4]++;
}
else stu[i].score =90;
}
else if(stu[i].answer ==3){
if(a[3]<b[3]/2){
stu[i].score =85;
a[3]++;
}
else stu[i].score =80;
}
else if(stu[i].answer ==2){
if(a[2]<b[2]/2){
stu[i].score =75;
a[2]++;
}
else stu[i].score =70;
}
else if(stu[i].answer ==1){
if(a[1]<b[1]/2){
stu[i].score =65;
a[1]++;
}
else stu[i].score =60;
}
else stu[i].score =50;
}
sort(stu,stu+t,cmp3);
for(int i=0;i<t;i++){
//cout<<stu[i].number <<" ";
cout<<stu[i].score <<endl;;
}
cout<<endl;
}
return 0;
}
浙公网安备 33010602011771号