1075. PAT Judge (25)

#include <stdio.h>
#include <algorithm>
using namespace std;

struct MyStruct
{
    int grade[6];
    int Done[6];
    int Perfect;
    int sum;
    int ID;
    int num;
};

int cmp(MyStruct a,MyStruct b)
{
    if(a.sum != b.sum ) return a.sum > b.sum;
    if(a.Perfect != b.Perfect) return a.Perfect > b.Perfect;
    return a.ID < b.ID;
}

MyStruct Student[10001];
MyStruct SqueStu[10001];
int main()
{
    int StuNum,ProNum,SubNum;
    int ProValue[6];
    int i,j;
    while(scanf("%d %d %d",&StuNum,&ProNum,&SubNum)!=EOF)
    {
        for(i=1;i<=StuNum;i++)
        {
            for(j=1;j<=5;j++)
            {
                Student[i].grade[j]=-1;
                Student[i].Done[j]=0;
            }
            Student[i].Perfect=0;
        }
        getchar();
        for(i = 1;i<=ProNum;i++)
            scanf("%d",&ProValue[i]);

        for(i=1;i<=SubNum;i++)
        {
            getchar();
            int TemID,TemProID,TemGrade;
            scanf("%d %d %d",&TemID,&TemProID,&TemGrade);
            if(TemGrade == -1) TemGrade = 0;
            else Student[TemID].Done[TemProID] = 1;
            if(TemGrade>Student[TemID].grade[TemProID])
            {
                Student[TemID].grade[TemProID]=TemGrade;
                Student[TemID].ID = TemID; 
                if(TemGrade == ProValue[TemProID]) Student[TemID].Perfect++;
            }
        }

        int SqueStuNum=0;
        for(i=1;i<=StuNum;i++)
        {
            int Temsum=0;
            int IfPrint = 0;
            for(j=1;j<=ProNum;j++)
            {
                if(Student[i].Done[j])
                {
                    IfPrint=1;
                    Temsum+=Student[i].grade[j];
                }
            }

            if(IfPrint)
            {
                Student[i].sum=Temsum;
                SqueStu[SqueStuNum++]=Student[i];
            }
        }


        sort(SqueStu,SqueStu+SqueStuNum,cmp);

        int tag=-100;
        int cnt=0;
        int add=1;
        for(i = 0;i < SqueStuNum ;i++)
        {    
            if( SqueStu[i].sum != tag )
            {
                tag = SqueStu[i].sum;
                cnt+= add;
                add=1;
            }
            else  ++add;

            printf("%d %05d %d",cnt,SqueStu[i].ID,SqueStu[i].sum);

            for(j= 1;j <= ProNum ;j++)
            {
                if(SqueStu[i].grade[j] == -1) printf(" -");
                else
                {
                    printf(" %d",SqueStu[i].grade[j]);
                }
            }
            printf("
");
        }
    }
    return 0;
}