hdu1236 排名

题目链接
题目不难，注意scanf不吸收回车，所以每次录入的时候需要把上一行的回车去掉（可用getchar（））；再者就是对排序的定义，分数不相等时以分数为升序，相等时以序号为降序。
代码如下：

#include<stdio.h>
#include<iostream>
#include<vector>
#include<string.h>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
#define inf 0x7fffffff
struct student {
	char id[25];
	int num;
	int solve;
	bool operator<(const student& a) const {

		if (solve != a.solve) return solve > a.solve;
		int tmp = strcmp(id, a.id);
		if (tmp != 0) return tmp < 0;
	}
}buf[1000];
int grade[11];
int main()
{
	int n;
	while (scanf("%d",&n)!=EOF&&n)
	{
		int m, g;
		scanf("%d%d", &m, &g);
		for (int i = 1;i <= m;i++) scanf("%d", &grade[i]);
		
		for (int i = 1;i <= n;i++)
		{   getchar();
			scanf("%s %d", buf[i].id, &buf[i].num);
			buf[i].solve = 0;
			for (int j = 1;j <= buf[i].num;j++)
			{
				int x;scanf("%d", &x);
				buf[i].solve += grade[x];
			}
		}
		sort(buf + 1, buf + 1 + n);
		int mark = 0;
		int cnt = 0;
		for (int i = 1;i <= n;i++)
		{
			if (buf[i].solve >= g) {
				cnt++;
				mark = i;
			}
		}	
		printf("%d\n", cnt);
		for (int i = 1;i <= mark;i++)
		{
			printf("%s %d\n", buf[i].id, buf[i].solve);
		}
	}
	return 0;
}