//jobdu 1014
//
#include<iostream>
#include <algorithm>
using std::cin;
using std::cout;
using std::string;
using std::sort;
struct stu{
string st;
int sum;
};
bool cmp(stu a,stu b)
{
return a.sum == b.sum ?a.st<b.st:a.sum>b.sum;
}
int main()
{
int i,j,N,M,G,pM[15],m,n,ppQ,score=0;
stu s[1005];
while(cin >> N, N)
{
n=0;
cin >> M >> G;
for(i = 0; i <= M-1;i++)
cin >> pM[i];
for(i = 0; i <= N-1; i++)
{
score = 0;
cin >> s[i].st >> m;
for(j = 0; j <= m-1; j++)
cin >> ppQ,score += pM[ppQ-1];
s[i].sum = score;
if(s[i].sum >= G)
n++;
}
cout << n <<'\n';
sort(s,s+N,cmp);
for(j = 0;j <= n-1; j++)
cout << s[j].st << ' ' << s[j].sum << '\n';
}
return 0;
}
/**************************************************************
Problem: 1014
User: true14fans
Language: C++
Result: Accepted
Time:170 ms
Memory:1528 kb
****************************************************************/
九度oj1014
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.