題目連結:https://vjudge.net/problem/HDU-1718
這題還好,不用考慮字典序排名(可以并列排名),看到有的人用了結構體或二重數組,介于這題的特殊性,其實不用這樣。
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>
using namespace std;
int main()
{
int jack,jack_grade,id,temp,grade[1010],num,Rank;
while(~scanf("%d",&jack))
{
memset(grade,0,sizeof(grade));
num=0;
while(scanf("%d %d",&id,&temp))
{
if(id==0&&temp==0) break;
num++;
if(id==jack) jack_grade=temp;
grade[num]=temp;
}
Rank=1;
for(temp=1;temp<=num;temp++)
if(grade[temp]>jack_grade) Rank++;
printf("%d\n",Rank);
}
}
轉載于:https://www.cnblogs.com/ACDoge/p/6142977.html