1025 PAT Ranking (25 分)

发布时间：2020-12-14 04:43:48 所属栏目：大数据来源：网络整理

导读：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

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?

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?

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

 1 #include <bits/stdc++.h>
 2 #define N 305
 3 using namespace std;
 4 int n,m,pos = 0;
 5 struct Node{
 6     string num;
 7     int score;
 8     int final_rank;
 9     int cc;
10     int local_rank;
11 }node[N],final[N*100];
12 bool cmp(Node a,Node b){
13     if(a.score == b.score){
14         return a.num < b.num;
15     }
16     return a.score > b.score;
17 }
18 
19 int main(){
20     cin >> n;
21     for(int i = 1; i<=n; i++){
22         cin >> m;
23         for(int j = 0; j < m; j++){
24             cin >> node[j].num >> node[j].score;
25         }
26         sort(node,node+m,cmp);
27         for(int j = 0; j < m; j++){
28             node[j].cc = i;
29             if(j == 0)
30                 node[j].local_rank = j+1;
31             else{
32                 if(node[j].score == node[j-1].score)
33                     node[j].local_rank = node[j-1].local_rank;
34                 else
35                     node[j].local_rank = j+1;
36             }
37             final[pos++] = node[j];
38         }
39     }
40     sort(final,final+pos,cmp);
41     cout << pos << endl;
42     for(int i = 0; i < pos; i++){
43         if(i==0){
44             final[i].final_rank = i+1;
45             cout <<final[i].num<<" "<<final[i].final_rank<<" "<<final[i].cc<<" "<<final[i].local_rank<<endl;
46         }else{
47             if(final[i].score == final[i-1].score)
48                 final[i].final_rank = final[i-1].final_rank;
49             else
50                 final[i].final_rank = i+1;
51             cout <<final[i].num<<" "<<final[i].final_rank<<" "<<final[i].cc<<" "<<final[i].local_rank<<endl;
52         }
53     }
54     return 0;
55 }

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!