Nth Largest Value

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

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

1 8

2 489

3 931

4 768

 #include <stdio.h> 

 int main(){

     int T;

     int n;

     int number;

     int i;

     int max;

     int middle;

     int min;

     scanf("%d",&T);

     while(T--){

         max=;     //对最大的三个数进行初始化

         middle=;

         min=;

         scanf("%d",&n);

         for(i=;i<;i++){

             scanf("%d",&number);

             if(number>max){    //如果找到当前最大的数，舍去最小数

                 min=middle;

                 middle=max;

                 max=number;

             }

             else if(number>middle){  //如果找到当前第二大的数，舍去最小数

                 min=middle;

                 middle=number;

             }

             else if(number>min)    //如果找到当前第三大的数，舍去最小数

                 min=number;

         }

         printf("%d %d\n",n,min);

     }

     return ;

 }

巴特西

Nth Largest Value

最新文章

热门文章