Result: Accepted
Time: 2ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct student
{
char c[102];
int s;
};
int comp(const void * p,const void * q)
{
return((struct student * )q)->s - ((struct student *)p)->s;
}
int main()
{
struct student x[1001];
int n,i,j;
scanf("%d",&n);
for(i = 0;i < n;i++)
{
scanf("%s %d",x[i].c,&x[i].s);
}
qsort(x,n,sizeof(struct student),comp);
int m,tem;
scanf("%d",&m);
while(m--)
{
char name[103];
scanf("%s",name);
strcat(name,":");
for(i = 0;i < n;i++)
{
if(strcmp(name,x[i].c) == 0)
break;
}
tem = x[i].s;
for(i = 0;i < n;i++)
{
if(x[i].s == tem)
break;
}
printf("%d\n",i);
}
}