1025 PAT Ranking （25 分）

问题描述：给定每个考场学生的成绩，排序输出总排名和考场排名（成绩递减然后学号递增）。

解题思路：方法一：每个考场进行排序，然后总的进行归并排序。方法二：每个考场排序，后面再一起排序。

AC代码：

方法二：

#include<bits/stdc++.h>
using namespace std;
class testee{
	public:
	string id;
	int score,location;
	int rank[2];
}; 
vector<testee>arr(30005);
bool cmp(const testee &t1,const testee &t2)
{
	return t1.score==t2.score?t1.id<t2.id:t2.score<t1.score;
}
void myrank(int f,int l,int r)
{
	int ranks=1,i;
	for(i=0;i<l-f;++i){
		while(arr[f+i+1].score==arr[f+i].score){
			arr[f+i].rank[r]=ranks;++i;
		}
		arr[f+i].rank[r]=ranks;
		ranks=i+2;
	}
}
int main()
{
	//freopen("test.txt","r",stdin); 
	int N,K,i,loc=1,M=0;
	scanf("%d",&N);
	while(N--){
		scanf("%d",&K);
		int ran=0;
		while(ran<K){
			testee t;
			cin>>t.id>>t.score;
			t.location=loc; 
			arr[M+ran]=t;
			++ran;
		}
		sort(arr.begin()+M,arr.begin()+M+K,cmp);
		myrank(M,M+K,0);
		M+=K;++loc;
	}
	sort(arr.begin(),arr.begin()+M,cmp);
	myrank(0,M,1);
	cout<<M<<endl;
	i=0;
	while(i<M){
		cout<<arr[i].id<<" "<<arr[i].rank[1]<<" "<<arr[i].location<<" "<<arr[i].rank[0]<<endl;
		++i;
	}
	return 0;
}

方法一：有两个测试点错误？？？？？？

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
typedef struct stu {
	string id;
	int sco, ran;
	stu(){}
	stu(string s,int n,int k):id(s),sco(n),ran(k){}
}stu;
#define MAX 101
vector<stu>arr[MAX];
bool operator <(stu &a, stu &b)
{
	if (a.sco == b.sco)return a.id < b.id;
	else return a.sco > b.sco;
}
int main()
{
	//freopen("test.txt", "r", stdin);
	int N, K, R = 0;
	scanf("%d", &N);
	for (int i = 1; i <= N; ++i) {//每个考场
		scanf("%d", &K);
		R += K;
		for (int j = 0; j < K; ++j) {
			string str;
			int sco;
			cin >> str >> sco;
			arr[i].push_back(stu(str, sco, 0));
		}
		sort(arr[i].begin(), arr[i].end());//排序
		//for (int j = 0; j < K; ++j)printf("%d ", arr[i][j].sco); printf("\n");
		arr[i][0].ran = 1;
		int a = arr[i][0].sco, R;
		for (int j = 1; j < K; ++j) {//考场排名
			if (arr[i][j].sco != a) {
				R = j + 1;
				a = arr[i][j].sco;
			}
			arr[i][j].ran = R;
		}
	}
	printf("%d\n", R);
	vector<int>Ran(N + 1, 0);
	int Ra = -1, num = 0, cnt = 1;
	while (num<R) {//总排名,归并排序
		stu a = stu("", -1, 0);
		int k;
		for (int i = 1; i <= N; ++i) {//找最大的一个
			if (Ran[i] < arr[i].size() && arr[i][Ran[i]] < a) {
				k = i;
				a = arr[i][Ran[i]];
			}
		}
		//for (int j = 1; j <= N; ++j)printf("%d ", Ran[j]); printf("\n");
		//cout << cnt << " ";
		++Ran[k];
		if (Ra != a.sco) {//排名变化
			cnt = num+1;
			Ra = a.sco;
		}
		cout << a.id << " " << cnt << " " << k << " " << a.ran << "\n";
		++num;
	}
	return 0;
}

//在考场排名时，R没给初值！！！！！！且重复定义，R本应该是总人数的，改为Rx=1;