A_Turtle_Puzzle_Rearrange_and_Negate.cpp

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        int a[n];
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        int sum = 0;
        for (int i = 0; i < n; i++)
        {
            sum += abs(a[i]);
        }
        cout << sum << endl;
    }

    return 0;
}