Minimum Total Removals

You are given T test cases. In each test case, you are provided with a number n and n integers, where each integer represents the number of products in a container. The goal is to compute the minimum total number of removals needed to empty all containers. Since you can only remove one product at a time from any container, the minimum total removals is simply the sum of all the products.

Formally, for each test case, if the containers have product counts \(a_1, a_2, \ldots, a_n\), then the answer is given by:

\(\sum_{i=1}^{n}{a_i}\)

The input is provided via standard input (stdin) and the output should be printed to standard output (stdout).

inputFormat

The input begins with an integer T (\(1 \leq T \leq 10\)) representing the number of test cases. Each test case starts with an integer n (\(1 \leq n \leq 10^5\)) denoting the number of containers, followed by n space-separated integers \(a_i\) (\(0 \leq a_i \leq 10^9\)) indicating the number of products in each container.

outputFormat

For each test case, output a single line containing the minimum total number of removals required to empty all containers. Each result should be printed on a new line.

1
3
4
6
3

13