九度OJ 1014 排名

#include <iostream>
#include <string.h>
#include <sstream>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
struct People
{
    string name;//准考证号
    int solutionNum;//做出题目的个数
    //vector<int> problem;
    int score;//得分
    bool operator <(const People other) const
    {
        if(score == other.score)
        {
            if(name.compare(other.name) < 0)
            {
                return true;
            }
            else
                return false;
        }
        else if(score > other.score)
        {
            return true;
        }
        else
            return false;
    }
};

int main()
{
   int stuNum,proNum,scoreLine;

   cin>>stuNum>>proNum>>scoreLine;
   while(stuNum!=0)
   {
       People peoArr[1001];
       int touchLine = 0;//过分数线的人
       int i;
       int proArr[11];//per problem‘s score
       for(i=1;i<=proNum;i++)
       {
           cin>>proArr[i];
       }

       for(i=0;i<stuNum;i++)
       {
           cin>>peoArr[i].name;
           cin>>peoArr[i].solutionNum;
           int j=0;
           peoArr[i].score = 0;
           for(j=0;j<peoArr[i].solutionNum;j++)
           {
               int index;//题目编号
               cin>>index;
               peoArr[i].score +=proArr[index];
           }
           if(peoArr[i].score >= scoreLine)
                touchLine++;

       }
       if(touchLine == 0)
        cout<<"0"<<endl;
       else
       {
           cout<<touchLine<<endl;
           sort(peoArr,peoArr+stuNum);
           for(i=0;i<touchLine;i++)
            {
                cout<<peoArr[i].name<<" "<<peoArr[i].score<<endl;
            }
       }
       cin>>stuNum>>proNum>>scoreLine;
   }
    return 0;
}