ACM刷题之HDU————Rank
2016-04-19 21:57
253 查看
Rank |
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 4407 Accepted Submission(s): 1258 |
Problem 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 Input20070101 20070102 100 20070101 33 20070103 22 20070106 33 0 0 |
Sample Output2 也是当初step留下来的题目。当时感觉很麻烦,而且也不一定能做出来。最近刚自学了结构体,正好练练手 注意: 1.题目里面要求是如果和jackson同分,就要jackson先。 2.题目里是按分数从大到小排!ORZ,,我竟然排反了。 中间还用到了结构体的排序。要自己定义cmp函数(感谢SpLinter_Cell 给的排序方法 下面是ac代码 #include<stdio.h> #include<string.h> #include<stdlib.h> #include<algorithm> using namespace std; typedef struct ranks{ int ids; int score; }rank; bool cmp(const ranks &a,const ranks &b){ return a.score>b.score; } int main() { ranks r[10011]; int jackson,i,j,x; while(scanf("%d",&jackson)!=EOF) { i=0; while(scanf("%d%d",&r[i].ids,&r[i].sco re)!=EOF) { if(r[i].ids==0&&r[i].score==0) break; if(r[i].ids==jackson) x=r[i].score; i++; } sort(r,r+i,cmp); for(j=0;j<i;j++) { if(r[j].score==x) { printf("%d\n",j+1); break; } } } } |
相关文章推荐
- 简单的mvc框架(六)
- 作业5
- 第七周学习进度情况
- Arnold AtArray API Test
- 典型用户和用户场景描述
- win8.1去掉鼠标右键回收站“固定到开始”屏幕的方法
- JAVA实训之封装
- oracle数据库安装1
- UML类图虚线箭头
- 简单的异步任务AsyncTask
- Esri公开课笔记_ArcGIS空间统计
- unityc#脚本中实现socket服务器的构建
- UML图总览
- 寒冬之下,浩瀚智能开单收银打印扫描POS为何能在批发零售门店商场 车销行业 风靡!:进销存+打印扫描POS机
- 发现一个新玩具 msys
- FZU 2147 A-B Game
- 从头认识多线程-1.14 优先级
- struct stat结构体简介
- 学习笔记之Service
- v 面试