题号：NC24803
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
You're given an integer array A. Please find the minimum k, to make it possible that after removing k elements in A, the rest of the array can be divided into two parts with equal sum.
In this division process, you can choose elements arbitrarily.
输入描述:
The fisrt line contains one integer T, the number of cases.
For each case, the first line contains N, the length of A.
Then one line with N integer A[1],A[2]...A[n]indicates the elements of A.
输出描述:
k as described above.