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 85Sample 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
题意：一道比较水的排序题，合并几组数据并排序，求出总的排名和在各组的排名。
思路：没有什么技巧，直接排序模拟。
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
class Node
{
public:
string num;
int s,r1,t,r2;
};
Node st[30005],st1[305];
bool cmp(Node x,Node y)
{
if(x.s!=y.s) return x.s>y.s;
else if(x.num!=y.num) return x.num<y.num;
}
int arry[110];
int main()
{
int n,m,i,j,k=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>arry[i];
for(j=0;j<arry[i];j++)
{
cin>>st1[j].num>>st1[j].s;
st1[j].t=i+1;
}
sort(st1,st1+arry[i],cmp);
st1[0].r2=1;
int cnt=0;
for(j=1;j<arry[i];j++)
{
if(st1[j].s==st1[j-1].s)
{
st1[j].r2=st1[j-1].r2;
cnt++;
}
else
{
st1[j].r2=st1[j-1].r2+cnt+1;
cnt=0;
}
}
for(j=0;j<arry[i];j++)
{
st[k].num=st1[j].num;
st[k].s=st1[j].s;
st[k].t=st1[j].t;
st[k++].r2=st1[j].r2;
}
}
sort(st,st+k,cmp);
j=0,st[0].r1=1;
for(i=1;i<k;i++)
{
if(st[i].s==st[i-1].s)
{
st[i].r1=st[i-1].r1;
j++;
}
else
{
st[i].r1=st[i-1].r1+j+1;
j=0;
}
}
cout<<k<<endl;
for(i=0;i<k;i++)
{
cout<<st[i].num<<" "<<st[i].r1<<" "<<st[i].t<<" "<<st[i].r2<<endl;
}
return 0;
}
原文：http://blog.csdn.net/zju_ziqin/article/details/19763981