ACMSTEP 1.3.8 Rank //水题 排序
2011-08-09 14:38
627 查看
原题链接
[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]
[align=left]Sample Output[/align]
一开始没有弄清楚题意就做,搞得乱七八糟,WA了两次。反复读题 重新写了一遍 AC。第一次用结构体做的。后来发现不需要,而且此题的题意理解和常规的 成绩排序有点不大一样。
Rank
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 821 Accepted Submission(s): 271[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
一开始没有弄清楚题意就做,搞得乱七八糟,WA了两次。反复读题 重新写了一遍 AC。第一次用结构体做的。后来发现不需要,而且此题的题意理解和常规的 成绩排序有点不大一样。
#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); } }
相关文章推荐
- HDOJ ACMstep 1.3.8 Rank(特殊的排序)
- POJ 2379 ACM Rank Table(排序)
- ACMSTEP 1.3.4 百步穿杨 //水题 结构体排序
- (STL自带的排序功能7.1.3)POJ 2379 ACM Rank Table(结构体的排序、初始化)
- UVALive Problem 7073 Song Jiang's rank list(排序)——2014ACM/ICPC亚洲区广州站
- POJ 2379 ACM Rank Table (排序)
- HDU ACM STEP 1.3.8 As Easy As A+B
- ACMSTEP 1.3.7 Wooden Sticks //排序 DP (LIS)
- 杭电acm step 1.3.8 Who's in the Middle
- ACMSTEP 1.3.6 老人真是饿了 //排序 贪心
- 杭电acm step 1.3.6 Rank
- (hdu step 1.3.8)Who's in the Middle(排序)
- ACMSTEP 1.3.5 排序//排序 字符串
- matlab:对一个向量进行排序,返回每一个数据的rank 序号 。。。
- 学习排序 Learning to Rank 小结<转>
- [Jobdu] 1324: The Best Rank & 1007: 奥运排序问题 & 1009: 二叉搜索树
- hdu ACM step 1.2.3 hdu1064
- acm--绝对值排序
- acm--不等长字符串排序(指向指针的指针)
- 杭电 ACM Step(3)