1415.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1415 on 2005-10-04 at 15:23:08 */ 
#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;

const int MAX = 16;

typedef struct {
	char name[32];
	int day;
	int weight;
} Person;

int cmp(const void*, const void*);

int main()
{
	Person p[MAX];
	char order[8];
	int pnum, i, t = 0;
	
	while(cin >> order) {
		if(t != 0) {
			cout << endl;
		}
		t++;
		pnum = 0;
		while(true) {
			cin >> p[pnum].name;
			if(!strcmp(p[pnum].name, "END")) {
				break;
			} else {
				cin >> p[pnum].day >> p[pnum].weight;
				if(p[pnum].day >= p[pnum].weight) {
					p[pnum].weight = 1;
				} else {
					p[pnum].weight = p[pnum].weight - p[pnum].day;
				}
				pnum++;
			}
		}
		qsort(p, pnum, sizeof(Person), cmp);
		for(i = 0; i < pnum; i++) {
			cout << p[i].name << endl;
		}
	}
	
	return 0;
}

int cmp(const void *a, const void *b)
{
	Person *x = (Person*)a, *y = (Person*)b;
	if(x->weight < y->weight) {
		return 1;
	} else {
		return -1;
	}
}