Submission #690849

#TimeUsernameProblemLanguageResultExecution timeMemory
690849vladiliusTable Tennis (info1cup20_tabletennis)C++17
0 / 100
822 ms1492 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

bool check(vector<ll> a){
    int n = a.size();
    ll 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<ll> 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<ll> b = a;
            b.erase(b.begin() + i + 1);
            if (check(b)){
                for (int j = 1; j < n; j++){
                    cout<<b[j]<<" ";
                }
                return 0;
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...