Result: Accepted
Time: 2ms
Memory: 1212kB
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct grade
{
char na[101];
int gar,nol;
}s[1001];
bool cap(const grade a,const grade b)
{
return a.gar>b.gar;
}
int main()
{
int n,i,m,j;
scanf("%d",&n);
for(i=0;i<n;++i)
{
scanf("%s",s[i].na);
scanf("%d",&s[i].gar);
}
sort(s,s+n,cap);
for(i=0;i<n;++i)
{
if(i>0)
{
if(s[i].gar==s[i-1].gar)
s[i].nol=s[i-1].nol;
else
s[i].nol=i+1;
}
else
s[i].nol=i+1;
}
scanf("%d",&m);
while(m--)
{
char l[101],l2;
int h=1;
scanf("%s",l);
strcat(l,":");
l2=strlen(l);
for(i=0;i<n;++i)
{
if(strncmp(l,s[i].na,l2+1)==0)
{
printf("%d\n",s[i].nol-1);
break;
}
}
}
}