1163: I think it's hard

时间限制: C/C++ 1 s      Java/Python 3 s      内存限制: 32 MB      答案正确: 21 / 129     

题目描述

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

提示

来源

标签


提交代码






© 2019 JustOJ     中文  English  | l.jiang.1024@gmail.com | Docs | System Info | Telegram Group | Telegram Channel