Codeforces Round #563 (Div. 2) A. Ehab Fails to Be Thanos

You’re given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn’t equal to the sum of the last n elements?

Input
The first line contains an integer n (1≤n≤1000), where 2n is the number of elements in the array a.

The second line contains 2n space-separated integers a1, a2, …, a2n (1≤ai≤106) — the elements of the array a.

Output
If there’s no solution, print “-1” (without quotes). Otherwise, print a single line containing 2n space-separated integers. They must form a reordering of a. You are allowed to not change the order.

Examples
inputCopy
3
1 2 2 1 3 1
outputCopy
2 1 3 1 1 2
inputCopy
1
1 1
outputCopy
-1
Note
In the first example, the first n elements have sum 2+1+3=6 while the last n elements have sum 1+1+2=4. The sums aren’t equal.

In the second example, there’s no solution.

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#define ll long long
#define dd double
using namespace std;

ll a[10005];

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