#include <iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 60;
typedef long long ll;
int arr[N];
void sovle() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> arr[i];
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += abs(arr[i]);
}
cout << sum << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
sovle();
}
return 0;
}
Codeforces Round 929 (Div. 3)--->A. Turtle Puzzle: Rearrange and Negate
最新推荐文章于 2024-10-10 22:59:02 发布