hrbust1002 Examination

最新推荐文章于 2019-11-03 15:57:35 发布

原创最新推荐文章于 2019-11-03 15:57:35 发布 · 781 阅读

1 ·

CC 4.0 BY-SA版权

hrbust题解专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一道竞赛编程题目，需要根据输入的班级数量、学生数量及查询的排名，从给定的数据中找出对应学生的分数。通过直接排序的方法解决此问题，并提供了完整的C++代码实现。

原题网址：http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1002

Examination

Time Limit: 1000 MS

Memory Limit: 65536 K

Total Submit: 3032(989 users)

Total Accepted: 1104(906 users)

Rating:

Special Judge: No

Description

 There are n classes in Mr Li’s grade.And each class have m student..The last examination’s ranked results have been finished.Now Mr Li wants to know the score of the student who got the kth place.

Input

Each test case have three integers n,m,k(1<=n<=10,1<=m<=100, 1<=k<=n*m) in the first line.Then,there are n lines,one line indicating the scores of one class.Each line contains m positive integers.
 Process to the end of file.

Output

For each test case,first print a line saying “Scenario #k”,where k is the number of the test case.Then,output one integer the score of student who are placed kth,in one line.Print a blank line after each test case,even after the last one.

Sample Input

4 4
87 98 59
67 88 99

Sample Output

 Scenario #1
 88

题意就是给你n,m,k; 然后给你n*m个数，问其中第k大数是多少。

数据范围小，直接排序就可以解决了，注意输出格式。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;

int main()
{
    int m,n,k;
    int Case = 1;
    int gra[1009];
    while(scanf("%d%d%d",&m,&n,&k) != EOF){
        memset(gra,0,sizeof(gra));
        int t = 0;
        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                scanf("%d",&gra[t++]);
            }
        }
        sort(gra,gra+m*n);
        printf("Scenario #%d\n%d\n\n",Case++,gra[m*n-k]);
    }
    return 0;
}