def solve():
n = int(input(''))
a = [int(x) for x in input('').split(' ')]
p, n = 0,0
for i in a:
if i > 0:
p+=i
if i<=0:
n+=i
print(max(abs(p) - abs(n), abs(n)-abs(p)))
t = int(input(''))
for i in range(t):
solve()
#include <bits\stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define ull unsigned long long
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
cin >> t;
while(t--){
ll n;
cin >> n;
ll a[n + 1], ans = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
ans += a[i];
}
cout << abs(ans) << '\n';
}
}903C - Boxes Packing | 887A - Div 64 |
755B - PolandBall and Game | 808B - Average Sleep Time |
1515E - Phoenix and Computers | 1552B - Running for Gold |
994A - Fingerprints | 1221C - Perfect Team |
1709C - Recover an RBS | 378A - Playing with Dice |
248B - Chilly Willy | 1709B - Also Try Minecraft |
1418A - Buying Torches | 131C - The World is a Theatre |
1696A - NIT orz | 1178D - Prime Graph |
1711D - Rain | 534A - Exam |
1472A - Cards for Friends | 315A - Sereja and Bottles |
1697C - awoo's Favorite Problem | 165A - Supercentral Point |
1493A - Anti-knapsack | 1493B - Planet Lapituletti |
747B - Mammoth's Genome Decoding | 1591C - Minimize Distance |
1182B - Plus from Picture | 1674B - Dictionary |
1426C - Increase and Copy | 520C - DNA Alignment |