HDU1236 字符串处理

简单

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
const int maxn = 1005;
struct node{
    char mm[ 24 ];
    int num;
    int ss;
}a[ maxn ];
int b[ 12 ];
bool cmp( node a,node b ){
    if( a.ss!=b.ss ) return a.ss>b.ss;
    else if( strcmp(a.mm,b.mm )<0 ) return true;
    return false;
}
int main(){
    int n,m,g;
    char mm[ 24 ];
    int num,ss;
    while( scanf("%d",&n)!=EOF,n ){
        scanf("%d%d",&m,&g);
        for( int i=1;i<=m;i++ )
            scanf("%d",&b[ i ]);
        int cnt=0;
        for( int i=1;i<=n;i++ ){
            scanf("%s",mm);
            scanf("%d",&num);
            ss=0;
            int t;
            for( int j=0;j<num;j++ ){
                scanf("%d",&t);
                ss+=b[t];
            }
            if( ss>=g ){
                strcpy(a[cnt].mm,mm);
                a[cnt].num=num;
                a[cnt].ss=ss;
                cnt++;
            }
        }
        sort( a,a+cnt,cmp );
        printf("%d\n",cnt);
        for(int i=0;i<cnt;i++ )
            printf("%s %d\n",a[i].mm,a[i].ss);
    }
    return 0;
}