PAT 甲级 1025. PAT Ranking (25)
来源:互联网 发布:mac和nars口红哪个滋润 编辑:程序博客网 时间:2024/06/06 00:15
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:251234567890001 951234567890005 1001234567890003 951234567890002 771234567890004 8541234567890013 651234567890011 251234567890014 1001234567890012 85Sample Output:
91234567890005 1 1 11234567890014 1 2 11234567890001 3 1 21234567890003 3 1 21234567890004 5 1 41234567890012 5 2 21234567890002 7 1 51234567890013 8 2 31234567890011 9 2 4
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<algorithm>#include<queue>#include <cmath>#include <map>#include <set>#include <cstring>using namespace std;struct stu {long long id;int score,localRank,pos,rank;};vector<stu> fin;bool cmp(stu a, stu b) {if (a.score != b.score) {return a.score > b.score;}else {return a.id < b.id;}}int main() {int n, m;cin >> n;for (int i = 1; i <= n; i++) {cin >> m;vector<stu> v(m);for (int j = 0; j < m; j++) {cin >> v[j].id >> v[j].score;v[j].pos = i;}sort(v.begin(), v.end(), cmp);v[0].localRank = 1;fin.push_back(v[0]);for (int j = 1; j < m; j++) {if (v[j].score == v[j - 1].score) {v[j].localRank = v[j - 1].localRank;}else {v[j].localRank = j + 1;}fin.push_back(v[j]);}}sort(fin.begin(), fin.end(), cmp);fin[0].rank = 1;for (int i = 1; i < fin.size(); i++) {if (fin[i].score == fin[i - 1].score) {fin[i].rank = fin[i - 1].rank;}else {fin[i].rank = i + 1;}}cout << fin.size()<< endl;for (int i = 0; i < fin.size(); i++) {printf("%013lld %d %d %d\n", fin[i].id, fin[i].rank, fin[i].pos, fin[i].localRank); //注意这里id如果直接用cout<<fin[i].id最后一个测试点不通过,特殊学号输出格式不对}return 0;}
- 1025. PAT Ranking (25) PAT 甲级
- 【PAT甲级】1025. PAT Ranking (25)
- PAT(甲级)1025. PAT Ranking (25)
- PAT甲级.1025. PAT Ranking (25)
- PAT甲级练习1025. PAT Ranking (25)
- 1025. PAT Ranking (25)-PAT甲级
- PAT 甲级 1025. PAT Ranking (25)
- PAT甲级 1025. PAT Ranking (25)
- 1025. PAT Ranking (25)-PAT甲级真题
- PAT甲级练习题A1025. PAT Ranking (25)
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT 1025. PAT Ranking (25)
- 【PAT】1025. PAT Ranking (25)
- PAT 1025. PAT Ranking (25)
- PAT 1025. PAT Ranking (25)
- PAT 1025. PAT Ranking (25)
- PAT 1025. PAT Ranking (25)
- 2017.9.23步入大三狗的我
- Linux操作系统的安装
- Ubuntu 中常用的命令
- 调参神器:Hyperopt
- MATLAB使用集锦一
- PAT 甲级 1025. PAT Ranking (25)
- wordpress代码实现网站地图sitemap的html和xml的方法
- 20 多个可以提高你Android开发技能的国外优秀开源 app
- 搭建图片服务器《四》:后台java代码springMVC+spring实现图片上传
- lua中面向对象(class)实现探索(二)
- 关于AI算法芯片实现的几点看法(原创)
- HttpClient 实现 快递100 快递查询
- iOS dispatch_async到主线程封装C接口
- java之多线程(3)--线程池&Callable