1209：I think it's hard

Xiao Ming is only seven years old, Now I give him some numbers, and ask him what is the second

largest sum if he can choose a part of them. For example, if I give him 1 、 2 、 3 ， then he should tell

me 5 as 6 is the largest and 5 is the second. I think it is too hard for him, isn ’ t it?

Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <=

10) which is the number of test cases. And it will be followed by T consecutive test cases.

Each test case starts with a line containing an integer N (1<N<10) , the number I give Xiao Ming . The

second line contains N Integer numbers ai (-10<ai<10),

For each test case, output the answer.

5
5

该题目包含在题集 ACM赛制中

题目来源 20100831湖工大校赛

共提交 12 次

通过率 41.67%

时间上限	内存上限
1000 MS	32 MB