hdu2093(AC排名)

#include<stdio.h>
#include<string.h>
typedef struct
{
    char name[12];
    int ac,time;
}node;
int main()
{
    node a[1000],temp;
    int n,m,j,d,v=0,i=0;
    char ch;
    scanf("%d%d",&n,&m);//输入
    while(scanf("%s",a[i].name)!=EOF&&strcmp(a[i].name,"0")!=0)//后面的是作测式用的
    {
        a[i].time=0;
        a[i].ac=0;
        for(j=0;j<n;j++)
        {
            scanf("%d",&d);

           if(t>0)
            {
                a[i].ac++;
                 a[i].time+=d;
                ch=getchar();
                if( ch=='(')
                   {
                       scanf("%d",&d);
                       a[i].time+=d*m;
                      ch= getchar();
                   }
            }
        }
         i++;  v++;
    }

    for(i=0;i<v;i++)//排序
    for(j=i+1;j<v;j++)
    if(a[i].ac<a[j].ac)
    {
        temp=a[i];a[i]=a[j];a[j]=temp;
    }
    else if(a[i].ac==a[j].ac&&a[i].time>a[j].time)
    {
        temp=a[i];a[i]=a[j];a[j]=temp;
    }
    else if(a[i].ac==a[j].ac&&a[i].time==a[j].time)
    if(strcmp(a[i].name,a[j].name)>0)
    {
        temp=a[i];a[i]=a[j];a[j]=temp;
    }

    for(i=0;i<v;i++)//输出
    printf("%-10s %2d %4d\n",a[i].name,a[i].ac,a[i].time);
    return 0;
}