hd 3279 Nth Largest Value

最新推荐文章于 2022-06-20 17:35:00 发布

原创最新推荐文章于 2022-06-20 17:35:00 发布 · 373 阅读

0 ·

CC 4.0 BY-SA版权

排序专栏收录该内容

12 篇文章

订阅专栏

CTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1004 Accepted Submission(s): 796

Problem Description

For this problem, you will write a program that prints the N ^th largest value in a fixed sized array of integers. To make things simple, N will be 3 and the array will always be have 10 decimal integer values.

Input

The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set consists of a single line containing the data set number, followed by a space,followed by 10 space separated decimal integers whose values are between 1 and 1000 inclusive.

Output

For each data set, generate one line of output with the following values: The data set number as a decimal integer, a space, and the 3 ^rd largest value of the corresponding 10 integers.

Sample Input

  
   4
1 1 2 3 4 5 6 7 8 9 1000
2 338 304 619 95 343 496 489 116 98 127
3 931 240 986 894 826 640 965 833 136 138
4 940 955 364 188 133 254 501 122 768 408

Sample Output

Source

2009 Greater New York Regional

Recommend

zhuweicong | We have carefully selected several similar problems for you: 3283 3282 3285 3280 3281

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int t,a[15],i,p;
    while(scanf("%d",&t)!=EOF)
    {
      while(t--)
      {
        scanf("%d",&p);
        for(i=0;i<10;i++)
        scanf("%d",&a[i]);
        sort(a,a+10);
        printf("%d %d\n",p,a[7]);
                }
                              }
return 0;    
}