浙大PAT甲级1025 PAT Ranking

1025 PAT Ranking

#include<math.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct Student
{
	char id[14];
	int score;
	int room;
	int room_rank;

}stu[50000];


bool cmp(Student a, Student b){
	if (a.score != b.score) return a.score>b.score;
	else return strcmp(a.id, b.id) < 0;
}

int main()
{
	int n, k,all=0;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &k);
		for (int j = 0; j < k; j++)
		{
			scanf("%s %d", stu[all].id, &stu[all].score);
			stu[all].room = i ;
			all++;
		}
		sort(stu+all-k,stu+all,cmp);
		stu[all - k].room_rank = 1;
		for (int j = all - k,rank=2; j < all; j++,rank++)
		{
			if (stu[j].score == stu[j + 1].score)
				stu[j + 1].room_rank = stu[j].room_rank;
			else
				stu[j + 1].room_rank = rank;
		}
	}

	sort(stu, stu + all, cmp);
	printf("%d\n", all);
	int tmp = 1;
	printf("%s %d %d %d\n", stu[0].id,tmp, stu[0].room, stu[0].room_rank);
	for (int i = 1; i <all; i++)
	{
		if (stu[i - 1].score != stu[i].score)
			tmp = i + 1;
		printf("%s %d %d %d\n", stu[i].id, tmp, stu[i].room, stu[i].room_rank);
	}
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值