1974: I think it's hard
内存限制：32 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：31
解决：12
题目描述
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.
样例输入 复制
2
3
1 2 3
4
0 1 2 3样例输出 复制
5
5