| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 2048 MB | 117 | 111 | 102 | 95.327% |
Geumjae has an array $a$ consisting of $n$ zeros. His goal is to transform it into a given target array using a minimum number of operations.
He can perform the following two types of operations any number of times, in any order:
Given the final target state of the array $a,ドル find the minimum total number of operations (both Increase and Smash) Geumjae needs to perform.
It can be shown that for any given final array, a sequence of operations always exists.
Each test contains multiple test cases. The first line contains the number of test cases $t$ (1ドル \le t \le 1000$). The description of the test cases follows.
The first line contains a single integer $n$ (1ドル \le n \le 100$) --- the number of elements in the array $a$.
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ (1ドル \le a_i \le 100$) --- the elements of the target array $a$.
For each test case, output a single integer --- the minimum number of operations required.
3 3 1 1 3 1 100 9 9 9 3 2 4 4 8 5 3
3 1 11
Explanation of the first test case:
The target array is $[1, 1, 3]$. A possible sequence of 3 operations (which is the minimum) is:
We used 2ドル$ Increase operations and 1ドル$ Smash operation for a total of 3ドル$ operations.
Explanation of the second test case:
The target array is $[100]$. A single Increase operation with $x = 100$ gives the target array.