总感觉自己的代码全靠蛮力,思想上需要改变。
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
struct node
{
int score, rank1, rank2, num;
string id;
};
vector<node> local;
vector<node> localSum;
bool cmp(node a, node b)
{
if(a.score != b.score) return a.score > b.score;
else return a.id < b.id;
}
int main()
{
int n, k, a;
scanf("%d", &n);
string s;
node p;
for (int i = 1; i <= n; i++)
{
local.clear();
scanf("%d", &k);
for (int j = 0; j < k; j++)
{
cin >> s >> a;
p.id = s;
p.score = a;
p.num = i;
local.push_back(p);
}
sort(local.begin(), local.end(), cmp);
for (int j = 0; j < local.size(); j++)
{
local[j].rank1 = j + 1;
}
for (int j = 1; j < local.size(); j++)
{
if (local[j].score == local[j - 1].score)
local[j].rank1 = local[j - 1].rank1;
}
localSum.insert(localSum.end(), local.begin(), local.end());
}
sort(localSum.begin(), localSum.end(), cmp);
for (int i = 0; i < localSum.size(); i++)
{
localSum[i].rank2 = i + 1;
}
for (int i = 1; i < localSum.size(); i++)
{
if (localSum[i].score == localSum[i - 1].score)
localSum[i].rank2 = localSum[i - 1].rank2;
}
cout << localSum.size() << endl;
for (int i = 0; i < localSum.size(); i++)
{
cout << localSum[i].id;
printf(" %d %d %d\n", localSum[i].rank2, localSum[i].num, localSum[i].rank1);
}
}