You have N candles of different lengths. For a candle of length L, you can light it for L minutes. Now there is load shedding in your city but as the exam is knocking, it’s necessary for you to study. You can study if there is any candle which is lit. Answer maximum amount of minutes you can study.
First line contains number of test case T (1 ≤ T ≤ 20). Each case starts with N (1 ≤ N ≤ 10). The next line has N integers Li (1 ≤ Li ≤ 10) which is the length of the i'th candle.
For each case, output maximum number of minutes you can study.
Input | Output |
---|---|
2 2 1 4 3 1 2 3 | 5 6 |