PAT 甲级 1025 PAT Ranking(统计+排序)

1025 PAT Ranking(25 分)

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (≤100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (≤300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

registration_number final_rank location_number local_rank

The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

Sample Input:

2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85

Sample Output:

9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4

Analysis:

At first glance, you can easily come up with sort.sort in  every test location ,then sort every student.Maybe it can be accetped .

Nevertheless, if use statistic to calculate their ranks(record the number of student in each socre ),it will be faster.

C++:

#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct inf{
	string s;
	int score;
	int l_n;
	int l_r;
	int f_r;
	inf(string s1,int sc,int l):s(s1),score(sc),l_n(l){}
};
vector<inf>v;
int r[101],l_r[101];
bool cmp(const inf &a, const inf &b)
{
	if(a.score!=b.score)
		return a.score>b.score;
	else
		return a.s<b.s;
}
int main()
{
	int n,count;
	cin>>n;
	for(int i=0;i<n;i++){
		int k;
		cin>>k;
		memset(l_r,0,sizeof(l_r));
		for(int j=0;j<k;j++){
			string s;
			int score;
			cin>>s>>score;
			r[score]++;
			l_r[score]++;
			v.push_back(inf(s,score,i+1));
		}
		count=0;
		for(int j=100;j>=0;j--){//statistic
			if(l_r[j]!=0){
				int temp=l_r[j];
				l_r[j]=count+1;
				count+=temp; 
			}
		}				
		for(int j=v.size()-1;j>=(int)v.size()-k;j--)
			v[j].l_r=l_r[v[j].score]; 
	}
	sort(v.begin(),v.end(),cmp);
	count=0;
	for(int j=100;j>=0;j--){
		if(r[j]!=0){
			int temp=r[j];
			r[j]=count+1;
			count+=temp; 
		}
	}	
	for(int j=0;j<v.size();j++)
		v[j].f_r=r[v[j].score];
	cout<<v.size()<<endl;
	for(int i=0;i<v.size();i++)
		cout<<v[i].s<<" "<<v[i].f_r<<" "<<v[i].l_n<<" "<<v[i].l_r<<endl;
	return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
提供的源码资源涵盖了Java应用等多个领域,每个领域都包含了丰富的实例和项目。这些源码都是基于各自平台的最新技术和标准编写,确保了在对应环境下能够无缝运行。同时,源码中配备了详细的注释和文档,帮助用户快速理解代码结构和实现逻辑。 适用人群: 适合毕业设计、课程设计作业。这些源码资源特别适合大学生群体。无论你是计算机相关专业的学生,还是对其他领域编程感兴趣的学生,这些资源都能为你提供宝贵的学习和实践机会。通过学习和运行这些源码,你可以掌握各平台开发的基础知识,提升编程能力和项目实战经验。 使用场景及目标: 在学习阶段,你可以利用这些源码资源进行课程实践、课外项目或毕业设计。通过分析和运行源码,你将深入了解各平台开发的技术细节和最佳实践,逐步培养起自己的项目开发和问题解决能力。此外,在求职或创业过程中,具备跨平台开发能力的大学生将更具竞争力。 其他说明: 为了确保源码资源的可运行性和易用性,特别注意了以下几点:首先,每份源码都提供了详细的运行环境和依赖说明,确保用户能够轻松搭建起开发环境;其次,源码中的注释和文档都非常完善,方便用户快速上手和理解代码;最后,我会定期更新这些源码资源,以适应各平台技术的最新发展和市场需求。 所有源码均经过严格测试,可以直接运行,可以放心下载使用。有任何使用问题欢迎随时与博主沟通,第一时间进行解答!

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值