# 排名

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26743    Accepted Submission(s): 10014

Problem Description

Input

< 1000 )、考题数M ( 0 < M < = 10 )、分数线（正整数）G；第2行排序给出第1题至第M题的正整数分值；以下N行，每行给出一

（题目号由1到M）。

Output

Sample Input
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

Sample Output
3 CS003 60 CS001 37 CS004 37 0 1 CS000000000000000002 20
Hint
Huge input, scanf is recommended.

#include<iostream>

#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int n,m,g,k[15];
struct node
{
string str;
}pp[1005];
bool cmp(node x,node y)
{
}
int main()
{
while(cin>>n)
{
if(!n) break;
cin>>m>>g;
int i,j,temp,ss,sum2=0;
memset(k,0,sizeof(k));
for(i=1;i<=m;i++) cin>>k[i];
for(i=0;i<n;i++)
{
cin>>pp[i].str>>temp;
while(temp--)
{
cin>>ss;
}
}
cout<<sum2<<endl;
if(sum2)
{
sort(pp,pp+n,cmp);
for(i=0;i<n;i++)
{