注：最后一个测试用例没过，只有29分，以后再看。。

#include 
     
      #include 
      
       struct record{    int atime;//arrive time    int utime;//use time:p    int isvip;//is vip?    int wtime;//waitting time    int isplayed;}s[10001];int viptag[101];int comp(const void*a,const void*b){    struct record *p=(struct record*)a,*q=(struct record*)b;    return p->atime-q->atime;}int comps(const void*a,const void*b){    struct record *p=(struct record*)a,*q=(struct record*)b;    return (p->atime+p->wtime)-(q->atime+q->wtime);}void InitTable(int table[],int k){    for(int i=1;i<=k;++i)        table[i]=8*3600;}void dalao(int table[],int k,int time){    for(int i=1;i<=k;++i)        if(table[i]
       
        120)p=120;        s[i].utime=p*60;        ++i;    }    qsort(s,n,sizeof(struct record),comp);//sorted by arriving time    scanf("%d %d",&m,&vipm);    for(i=0;i
        
         =twentyone)break;        int isfind=0,v=FindEarlyLeavevip(table,m);        int curtime;        if(v)//vip table        {            curtime=table[v];            int k=cur;            while(s[k].atime<=curtime&&k
         
          =30)wt=wt/60+1;            else wt=wt/60;            printf("%02d:%02d:%02d %02d:%02d:%02d %d\n",at/3600,at/60%60,at%60,st/3600,st/60%60,st%60,wt);        }    }    for(i=1;i<=m;++i)    {        printf("%d",tablecount[i]);        if(i!=m)printf(" ");    }    return 0;}