题目大意:
PAT成绩排序
代码:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 10010;
int mark[6]; //课程的满分
struct Student
{
int id;
int course[6]; //course[0]为总得分
int num; //满分的个数
bool flag; //是否需要输出
}stu[maxn];
bool cmp(Student a, Student b)
{
if(a.flag != b.flag) return a.flag > b.flag;
else if(a.course[0] != b.course[0]) return a.course[0] > b.course[0];
else if(a.num != b.num) return a.num > b.num;
else return a.id < b.id;
}
int main(int argc, const char * argv[])
{
int n, k, m;
scanf("%d %d %d", &n, &m, &k);
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
stu[i].course[j] = -2;
}
stu[i].id = i;
stu[i].course[0] = 0;
stu[i].flag = false;
stu[i].num = 0;
}
for(int i = 1; i <= m; i++)
{ //标记题目分值
scanf("%d", &mark[i]);
}
for(int i = 0; i < k; i++)
{
int id, c, grade;
scanf("%d %d %d", &id, &c, &grade);
if(grade >= 0)
{ //如果grade >= 0, 说明编译通过
stu[id].flag = true; //标记为可以输出
if(grade > stu[id].course[c])
{ //课程c的成绩比原成绩高
if(stu[id].course[c] >= 0) //更新总分
stu[id].course[0] = stu[id].course[0] - stu[id].course[c] + grade;
else stu[id].course[0] += grade;
stu[id].course[c] = grade; //更新课程c的成绩
if(grade == mark[c]) stu[id].num++; //如果为满分,满分的题目数加1
}
}
if(grade == -1 && stu[id].course[c] == -2)
{ //如果提交题目但编译未通过,修改该题的得分为0
stu[id].course[c] = 0;
}
}
sort(stu + 1, stu + 1 + n, cmp);
int rank = 1; //输出第一名的成绩
printf("%d %05d %d", rank, stu[1].id, stu[1].course[0]);
for(int j = 1; j <= m; j++)
{
if(stu[1].course[j] >= 0) printf(" %d", stu[1].course[j]);
else printf(" -");
}
printf("\n");
for(int i = 2; i <= n; i++)
{ //输出成绩
if(stu[i].flag){
if(stu[i].course[0] != stu[i - 1].course[0]) rank = i;
printf("%d %05d %d", rank, stu[i].id, stu[i].course[0]);
for(int j = 1; j <= m; j++)
{
if(stu[i].course[j] >= 0) printf(" %d", stu[i].course[j]);
else printf(" -");
}
printf("\n");
}
else
{
break;
}
}
return 0;
}