forked from zapellass123/OpenEmailGenerator
-
Notifications
You must be signed in to change notification settings - Fork 0
/
D_Corrupted_Array.cpp
69 lines (67 loc) · 1.58 KB
/
D_Corrupted_Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define set_bits __builtin_popcountll
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop for(int i = 0; i < n; i++)
using namespace std;
int countDigit(long long n){
return floor(log10(n) + 1);
}
//-----------------------------------------------------------------------------
void solve(){
int n; cin >> n;
int a[n+2];
for(int i = 0; i < n+2; i++){
cin >> a[i];
}
sort(a, a+n+2);
int index = -1;
int sum = accumulate(a, a+n+2, 0);
for(int i = 0; i < n+1; i++){
int temp = (sum-a[i]);
// cout << i<<" temp " << temp << endl;
if(temp%2 == 0){
if(temp/2 == a[n+1]){
index = i;
// cout << index << endl;
break;
}
}
}
if((sum-a[n+1])%2==0){
if(a[n] == (sum-a[n+1])/2) index = n+1;
}
// cout << index << endl;
// cout << endl;
if(index == -1){
cout << index << endl;
return;
}
if(index == n+1){
for(int i = 0; i < n; i++){
cout << a[i] << " ";
}
cout << endl;
return;
}
for(int i = 0; i < n+1; i++){
if(i != index)cout << a[i] << " ";
}
cout << endl;
return;
}
//----------------------------------------------------------------------------
int32_t main(){
int t; cin >> t;
while(t--){
solve();
}
return 0;
}