hdu1872稳定排序

#include<bits/stdc++.h>
using namespace std;
struct tt{
	char name[53];
	int sum;
}a[302],b[302];
bool cmp(tt x,tt y){
	return x.sum>y.sum;
}
int main(){
	int n;
	while(cin>>n){
		int c1=0,c2=0,ans=0;
		for(int i=0;i<n;i++)
			cin>>a[i].name>>a[i].sum;
		for(int i=0;i<n;i++)
			cin>>b[i].name>>b[i].sum;
		stable_sort(a,a+n,cmp);
		for(int i=0;i<n;i++){
			if(a[i].sum==b[i].sum) c1++;
			if(strcmp(a[i].name,b[i].name)==0) c2++;
		}
		if(c1==n&&c2==n) ans=1;
		else if(c1==n&&c2!=n) ans=2;
		else ans=3;
		if(ans==1) cout<<"Right"<<endl;
		else{
			if(ans==2) cout<<"Not Stable"<<endl;
			else if(ans==3) cout<<"Error"<<endl;
			for(int i=0;i<n;i++) 
				cout<<a[i].name<<" "<<a[i].sum<<endl;
		}
	}
    return 0;
}