ACMSTEP 1.3.8 Rank //水题 排序
来源:互联网 发布:narcissu知乎 编辑:程序博客网 时间:2024/06/15 11:19
原题链接
Rank
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 821 Accepted Submission(s): 271Problem Description
Jackson wants to know his rank in the class. The professor has posted a list of student numbers and marks. Compute Jackson’s rank in class; that is, if he has the top mark(or is tied for the top mark) his rank is 1; if he has the second best mark(or is tied) his rank is 2, and so on.
Input
The input consist of several test cases. Each case begins with the student number of Jackson, an integer between 10000000 and 99999999. Following the student number are several lines, each containing a student number between 10000000 and 99999999 and a mark between 0 and 100. A line with a student number and mark of 0 terminates each test case. There are no more than 1000 students in the class, and each has a unique student number.
Output
For each test case, output a line giving Jackson’s rank in the class.
Sample Input
2007010120070102 10020070101 3320070103 2220070106 330 0
Sample Output
2
#include <cstdio>#include <cstdlib>using namespace std;int cmp(void const *x,void const *y){ return *((int *)y)-*((int *)x);}int main(){int n,num[1001];int grade[1001],count,i,j,temp;while(scanf("%d",&n)!=EOF){for(i=0;;i++){scanf("%d%d",&num[i],&grade[i]);if(num[i]==n)temp = grade[i];if( !num[i] && !grade[i])break;}qsort(grade,i,sizeof(grade[0]),cmp);count=0;for(j=0;j<i;j++){if(grade[j]>temp||grade[j]==temp)count++;if(grade[j]==temp)break;}printf("%d\n",count);}}
- ACMSTEP 1.3.8 Rank //水题 排序
- HDOJ ACMstep 1.3.8 Rank(特殊的排序)
- ACMSTEP 1.3.4 百步穿杨 //水题 结构体排序
- ACMSTEP 1.3.5 排序//排序 字符串
- ACMSTEP 1.3.7 Wooden Sticks //排序 DP (LIS)
- ACMSTEP 1.3.1 FatMouse Trade //结构体排序
- ACMSTEP 1.3.6 老人真是饿了 //排序 贪心
- ACMSTEP 1.3.3 Tian Ji -- The Horse Racing //排序 枚举
- acmstep 1.3.2
- ACMSTEP 1.2.8 AC me! //水题 模拟题
- hdu acmstep 1.3.7 贪心
- oracle rank排序
- mysql rank 排序
- R-排序order(),sort(),rank()
- 【搜索排序】Learning to rank
- ACMSTEP 2.2.5 3n+1 Problem //水题 枚举 模拟
- ACMSTEP 2.3.8 小兔的棋盘 //高精度 卡特兰数
- HDU 1.3.6 Rank
- 2011.8.1-5 周总结
- matlab连通域处理函数们
- 使用反射动态调用类成员,需要Type类的一个方法:InvokeMember。对该方法的声明如下(摘抄于MSDN):
- android button的两种响应点击的方法
- 多线程编程
- ACMSTEP 1.3.8 Rank //水题 排序
- 关于委托、事件、Invoke和BeginInvoke 的理解
- 注册表的一些操作介绍
- 任意形状窗体生成器(窗体有置顶效果)
- 增强for循环和泛型的使用
- linux下视频传输测试
- LINQ初体验(一)LINQ to Object
- dedecms横向滚动图片
- 国家税务总局:8月工资9月发放按3500元起征个税