1236.cpp

杭电 acm部分代码 有兴趣的可以下载 谢谢

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct stu{
    char num[30];
    int solve;
    int mark;
}vec[1001];
int cmp(stu t1,stu t2){
    if(t1.mark!=t2.mark)
        return t1.mark>t2.mark;
    else
        return strcmp(t1.num,t2.num)<0;
}
void main()
{
    int n,m,g;
    while(cin>>n>>m>>g){
        if(!n)  break;
        memset(vec,0,sizeof(vec));
        int t,k,count=0;
        int sco[15];
        int i=0;
        while(i<m)
            cin>>sco[i++];
        i=0;
        while(i<n){
            cin>>vec[i].num;
            cin>>vec[i].solve;
            k=vec[i].solve;
            while(k--){
                cin>>t;
                vec[i].mark+=sco[t-1];
            }
            if(vec[i].mark>=g)
                count++;
            i++;
        }
        sort(vec,vec+n,cmp);
        cout<<count<<endl;
        for(i=0;i<count;i++)
            cout<<vec[i].num<<" "<<vec[i].mark<<endl;
    }
}