ACM hdoj1084测试了很多数据，提交就wa

Question

http://acm.hdu.edu.cn/showproblem.php?pid=1084
代码如下
#include
#include
using namespace std;
struct score{
int p;
string t;
};
int main()
{
int t;
while(cin>>t && t>=0){
score sco[100];
// memset(sco,0,sizeof(sco));
for(int i=0;i sco[i].t.clear();
cin>>sco[i].p>>sco[i].t;
}
for(int i=0;i bool flag = true;
int first=0,last=0;
for(int j=0;j if(sco[i].p==sco[j].p&&sco[i].t first ++;
}
if(sco[i].p==sco[j].p&&sco[i].t>sco[j].t){
last++;
}
if(first<=last&&first+last!=0)
flag = false;
}
if(flag==true){
if(sco[i].p == 5)
cout<<"100"<<endl;
else if(sco[i].p == 0)
cout<<"50"<<endl;
else
cout<<(sco[i].p+5)*10 +5<<endl;
}
else{
if(sco[i].p == 5)
cout<<"100"<<endl;
else if(sco[i].p == 0)
cout<<"50"<<endl;
else
cout<<(sco[i].p+5)*10<<endl;
}
}
cout<<endl;
}
return 0;
}