Online Programming Server
Contest 1001: BISTU 20110904 In-school contest - Problem 1070: I think it's hard
| Problem ID | 1070 |
|---|---|
| Title | I think it's hard |
| Description | Siu 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? |
| Input | 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 Siu Ming. The second line contains N Integer numbers ai (-10 < ai < 10),
|
| Output | For each test case, output the answer. |
| Sample Input | 2 3 1 2 3 4 0 1 2 3 |
| Sample Output | 5 5 |
| Hint | |
| Last Modified | 2012-04-11 00:34:13 |
| Time Limit | 1 seconds |
| Memory Limit | 32 MB |
| Accepted Solutions | 1 |
| Submitted Solutions | 1 |
| Difficulty Factor | 0 |
Facebook