（HDU）1236 -- 排名

题目链接：http://vjudge.net/problem/HDU-1236

很疑惑我的代码在OJ过不了TLE，或者Run Time Error

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>

using namespace std;

typedef struct
{
    char id[100];
    int grade;
}people;
    people x[1005];

bool cmp(people a,people b)
{
    if(a.grade==b.grade)
        return strcmp(a.id,b.id);
    return a.grade<b.grade;
}

int main()
{
    int n,m,g,i,j,ti[10],num,temp,cnt;
    while(~scanf("%d",&n)&&n)
    {
        cnt=0;
        memset(ti,0,sizeof(ti));
        memset(x,0,sizeof(x));
        scanf("%d %d",&m,&g);

        for(i=1;i<=m;i++)
        scanf("%d",&ti[i]);

        for(i=1;i<=n;i++)
        {
            scanf("%s",x[i].id);
            scanf("%d",&num);
            x[i].grade=0;
            for(j=1;j<=num;j++)
            {
                scanf("%d",&temp);
                x[i].grade+=ti[temp];
            }
            if(x[i].grade>=g) cnt++;
        }

        sort(x+1,x+1+n,cmp);
        if (cnt==0) printf("0
");
        else
        {
            printf("%d
",cnt);
            for(i=1;i<=cnt;i++)
                printf("%s %d
",x[i].id,x[i].grade);
        }
    }
    return 0;
}

本地测试毫无问题...某人用qsort过了我用sort就出各种问题...（下面是wubaizhe AC的代码，我的还需要改）

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<ctype.h>
#include<float.h>
#define maxn 1005
typedef struct{
    char num[25];
    int grade;
}student;
student b[maxn];
int a[20];
int comp(const void* a,const void* b){
    student *p1 = (student*)a;
    student *p2 = (student*)b;
    if(p2->grade == p1->grade) //若分数相同，则用strcmp函数比较（很简单的道理，仔细想想就能相通）
        return strcmp(p1->num,p2->num);   
    return (p2->grade - p1->grade);
}
int main(){
    int n,m,g,i,j,N,tinum,cnt;
    while(scanf("%d",&n) != EOF && n){
        cnt = 0;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        scanf("%d%d",&m,&g);
        for(i=0 ;i<m ;i++)
            scanf("%d",&a[i]);
        for(i=0 ;i<n ;i++){
            scanf("%s",b[i].num);
            scanf("%d",&N);
            for(j=0 ;j<N ;j++){
                scanf("%d",&tinum);
                b[i].grade += a[tinum - 1];
            }
            if(b[i].grade >= g)
                cnt++;
        }
        qsort(b,n,sizeof(b[0]),comp);
        if(cnt == 0){
            printf("0
");
        }
        else{
            printf("%d
",cnt);
            for(i=0 ;i<cnt ;i++){
                printf("%s %d
",b[i].num,b[i].grade);
            }
        }
    }
    return 0;
}