1718 Rank
2016-03-14 21:47
363 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, output a line giving Jackson’s rank in the class.
[align=left]Sample Input[/align]
20070101
20070102 100
20070101 33
20070103 22
20070106 33
0 0
[align=left]Sample Output[/align]
2
View Code
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, output a line giving Jackson’s rank in the class.
[align=left]Sample Input[/align]
20070101
20070102 100
20070101 33
20070103 22
20070106 33
0 0
[align=left]Sample Output[/align]
2
#include <iostream> #include <algorithm> #include <stdio.h> #include <string.h> #include <math.h> using namespace std; int main() { int JK,haoma,a[1005],data,k; while(cin>>JK) { k=0; while(~scanf("%d%d",&haoma,&a[k])) { k++; if(haoma==JK) data=a[k-1]; if(haoma==0&&a[k-1]==0) break; } sort(a,a+k); for(int i=0;i<k;i++) if(data<a[i]) { data=k-i+1; break; } cout<<data<<endl; } return 0; }
View Code
相关文章推荐
- 输入输出流
- 225. Implement Stack using Queues
- ARM 汇编常用指令
- Problem A: 输入字符串以及输出
- AmS内部原理(android内核学习记录)
- ViewPager,RadioGroup,FragmentManager 详解 <三> Fragment,ViewPager 和PagerTabStrip
- Zookeeper中的FastLeaderElection算法
- jquerymobile动态添加元素之后
- 模板_KD-Tree
- 新手学Linux(四)----Linux下安装配置MongoDB数据库
- 叶公好龙乎?
- 232. Implement Queue using Stacks&225. Implement Stack using Queues
- BZOJ_P2648 SJY摆棋子&BZOJ_P2716 [Violet 3]天使玩偶(KD-Tree)
- windows快速搭建本地apache php mysql开发环境,多站点域名访问
- 视频控件 VideoView使用
- 项目4-换分币
- Linux学习笔记(一)
- Unix环境高级编程—进程控制(二)
- ZooKeeper示例 实时更新server列表
- 如何给一个Label设置不同的文字属性