排名

4 5 25
10 10 12 13 15
CS004 3 5 1 3
CS003 5 2 4 1 3 5
CS002 2 1 2
CS001 3 2 3 5
1 2 40
10 30
CS001 1 2
2 3 20
10 10 10
CS000000000000000001 0
CS000000000000000002 2 1 2
0

3
CS003 60
CS001 37
CS004 37
0
1
CS000000000000000002 20

Hint
Huge input, scanf is recommended.
 

水题。。。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct node
{
	char num[25];
	int sco;
}c[1005];
bool cmp(node x,node y)
{
	if(x.sco>y.sco) return true;
	if(x.sco==y.sco&&strcmp(x.num,y.num)<0) return true;
	return false;
}
int main()
{
	int n,m,p,a[15];
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)
		break;
		int count=0;
		scanf("%d %d",&m,&p);
		for(int i=0;i<m;i++)
		scanf("%d",&a[i]);
		for(int i=0;i<n;i++)
		{
			int x;
			scanf("%s %d",c[i].num,&x);
			c[i].sco=0;
			for(int j=0;j<x;j++)
			{
				int temp;
				scanf("%d",&temp);
				c[i].sco+=a[temp-1];
			}
			if(c[i].sco>=p)
			count++;
		}
		sort(c,c+n,cmp);
		printf("%d\n",count);
		for(int i=0;i<count;i++)
		printf("%s %d\n",c[i].num,c[i].sco);
	}
	return 0;
}