A. Ehab Fails to Be Thanos

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t;

int a[2010];

int main()
{
    cin >> n;
    for (int i = 1;i <= 2*n;i++)
        cin >> a[i];
    sort(a+1, a+1+2*n);
    if (accumulate(a+1, a+1+n, 0) == accumulate(a+n+1, a+1+2*n, 0))
        cout << -1 << endl;
    else
    {
        for (int i = 1; i <= 2 * n; i++)
            cout << a[i] << ‘ ‘;
        cout << endl;
    }

    return 0;
}