PAT Ranking

[编程题]PAT Ranking (25)

• 热度指数：806时间限制：1秒空间限制：65536K
• 算法知识视频讲解

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

输入描述:

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.

输出描述:

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.

示例1

输入

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

输出

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

// pat.cpp : 定义控制台应用程序的入口点。

//#include "stdafx.h"
#include"stdio.h"
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<math.h>
using namespace std;
const int maxn=10010;
struct node{
 
string id;
int mark;
int num;
int rank;
int localrank;
node(string id,int mark,int num):id(id),mark(mark),num(num){}
 
};
vector<node>vec;
vector<node>ans;
int n,m;
bool cmp(node a,node b){if(a.mark!=b.mark)return a.mark>b.mark;
else return a.id<b.id;}

bool cmp2(node a,node b){return a.mark>b.mark;}//考场内排名不需要按名字，否则会超时
int main(){
 
    //freopen("c://jin.txt","r",stdin);
    cin>>n;
    for(int i=1;i<=n;i++){
    cin>>m;
    vec.clear();
    while(m--){
    string id;int mark;
    cin>>id>>mark;
    vec.push_back(node(id,mark,i));
    sort(vec.begin(),vec.end(),cmp2);
     
    }
    if(vec.size()>0){vec[0].localrank=1;
    ans.push_back(vec[0]);}
    for(int j=1;j<vec.size();j++)
    {   if(vec[j].mark==vec[j-1].mark)vec[j].localrank=vec[j-1].localrank;
        else vec[j].localrank=j+1;//排名需要加一
        ans.push_back(vec[j]);
    }
    }
    sort(ans.begin(),ans.end(),cmp);
    cout<<ans.size()<<endl;
    if(ans.size()!=0){cout<<ans[0].id<<" 1 "<<ans[0].num<<" "<<ans[0].localrank<<endl;
    ans[0].rank=1;}
    for(int i=1;i<ans.size();i++){
    if(ans[i].mark==ans[i-1].mark)ans[i].rank=ans[i-1].rank;
        else ans[i].rank=i+1;
        cout<<ans[i].id<<" "<<ans[i].rank<<" "<<ans[i].num<<" "<<ans[i].localrank<<endl;
    }
 
 
 
 
 
    //freopen("CON","r",stdin);
    //system("pause");
 
    return 0;
}