总结：
这道题我用了结构体数组存每个考点的数据，最后放进vector中进行总的排序，第一次最后一个测试点超时了，后来把ID变成char*类型就=ok了，看来cin,cout输入输出string很费时间，考场上尽量用scanf和printf把
代码：
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
struct node{
char ID[50];
int score;
int rank;
int totalrank;
int localtion;
};
bool cmp(const node&a, const node&b){
if (a.score != b.score) return a.score > b.score;
else {
if (strcmp(a.ID, b.ID) < 0)return true;
else return false;
}
}
struct node ss[1000][1000];
int number[1000];
vector<node> result;
int main()
{
int lt; int max = 0;
cin >> lt;
for (int i = 0; i < lt; i++)
{
scanf("%d", &number[i]); if (number[i]>max)max = number[i];
for (int j = 0; j < number[i]; j++)
{
scanf("%s",ss[i][j].ID); scanf("%d", &ss[i][j].score); //ss[i][j]第i+1个考场的第j名学生
ss[i][j].localtion = i + 1;
}
sort(ss[i], ss[i] + number[i], cmp); int et = 1;
for (int j = 0, rank = 1; j < number[i]; j++, et++)
{
if (j == 0) ss[i][j].rank = rank;
else {
if (ss[i][j].score != ss[i][j - 1].score){
rank = et; ss[i][j].rank = rank;
}
else ss[i][j].rank = rank;
}
result.push_back(ss[i][j]);
}
}
sort(result.begin(), result.end(), cmp); int totalrank = 1;
printf("%d\n", result.size());
int per = 1;
for (auto it = result.begin(); it != result.end(); it++, per++)
{
if (it == result.begin())it->totalrank = totalrank;
else{
auto it2 = it; it2--;
if (it->score == it2->score){ it->totalrank = totalrank; }
else { totalrank = per; it->totalrank = totalrank; }
}
printf("%s ",it->ID);
printf("%d %d %d\n", it->totalrank, it->localtion, it->rank);
}
return 0;
}