hdu 1872 稳定排序

#include<bits/stdc++.h>
using namespace std;
struct Stu{ char n[55]; int g;}s[305];
int main(){
	int n, vis;
    while(scanf("%d", &n) == 1){
        for(int i = 1; i <= n; i++) scanf("%s %d", &s[i].n, &s[i].g);
        stable_sort(s+1, s+n+1, [](Stu x, Stu y){ return x.g > y.g;});
        vis = 1;
        for(int i = 1; i <= n; i++){
            scanf("%s %d", &s[0].n, &s[0].g);
            if(vis == -1) continue; //排序错误
            if(s[0].g != s[i].g) vis = -1; 
            else if(strcmp(s[0].n , s[i].n) != 0) vis = 0; 
        }
        if(vis == 1) printf("Right\n");
        else{
            if(vis == 0)  printf("Not Stable\n"); 
            else printf("Error\n");
            for(int i = 1; i <= n; i++)
                printf("%s %d\n", s[i].n, s[i].g);
        }
    }
	return 0;
}
备注：直接调用库函数 stable_sort()进行稳定排序
```[添加链接描述](http://acm.hdu.edu.cn/showproblem.php?pid=1872)