# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690843 | vladilius | Table Tennis (info1cup20_tabletennis) | Cpython 3 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool check(vector<int> a){
int n = a.size(), k = a[1] + a.back();
for (int i = 1; i < n - i - 1; i++){
if (a[i + 1] + a[n - i - 1] != k){
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k; cin>>n>>k;
vector<int> a(n + k);
for (int i = 0; i < n + k; i++){
cin>>a[i];
}
sort(a.begin(), a.end());
if (k == 1){
for (int i = 0; i < n; i++){
vector<int> b = a;
b.erase(b.begin() + i + 1);
if (check(b)){
for (int j = 1; j < n; j++){
cout<<b[j]<<" ";
}
return 0;
}
}
}
}