标签：hdu1872

稳定排序

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 1   Accepted Submission(s) : 1

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

Input

Output

Sample Input

3
aa 10
bb 10
cc 20
cc 20
bb 10
aa 10
3
aa 10
bb 10
cc 20
cc 20
aa 10
bb 10
3
aa 10
bb 10
cc 20
aa 10
bb 10
cc 20

Sample Output

Not Stable
cc 20
aa 10
bb 10
Right
Error
cc 20
aa 10
bb 10

#include <stdio.h>
#include <string.h>
#include <algorithm>
using std::stable_sort;
struct Node{
	char name[52];
	int sco;
} arr[302], tem[302];
bool notStable, error;

bool cmp(Node a, Node b){
	return a.sco > b.sco;
}

int main(){
	int n;
	while(scanf("%d", &n) != EOF){
		for(int i = 0; i < n; ++i)
			scanf("%s%d", arr[i].name, &arr[i].sco);
		stable_sort(arr, arr + n, cmp);
		
		notStable = error = 0;		
		for(int i = 0; i < n; ++i){
			scanf("%s%d", tem[i].name, &tem[i].sco);
			if(tem[i].sco != arr[i].sco) error = 1;
			else if(strcmp(tem[i].name, arr[i].name)) notStable = 1;
		}
		if(notStable == 0 && error == 0){
			printf("Right\n");
			continue;
		}
		if(error) printf("Error\n");
		else if(notStable) printf("Not Stable\n");
		
		for(int i = 0; i < n; ++i)
			printf("%s %d\n", arr[i].name, arr[i].sco);
	}
	return 0;
}

HDU1872 稳定排序,布布扣,bubuko.com

HDU1872 稳定排序

标签：hdu1872

原文地址：http://blog.csdn.net/u012846486/article/details/27826787