Submission #1231727

#TimeUsernameProblemLanguageResultExecution timeMemory
1231727khomeTable Tennis (info1cup20_tabletennis)C++20
11 / 100
3093 ms2884 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int inf = 1e9;

void solve(){
    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());

    auto check = [&]() -> bool {
        for (int i = 0; i < n/2 - 1; i++) {
            if (a[i] + a[n - i - 1] != a[i + 1] + a[n - i - 2]) return false;
        }
        return true;
    };

    for (int i = 0; i < n + k; i++) {
        int x = a[i];
        a.erase(a.begin() + i);
        if (check()) {
            for (int j : a) cout << j << ' ' ; cout << endl; return;
        }
        a.insert(a.begin() + i, x);
    }

}

signed main(){
    int t = 1;
    // cin >> t;
    while (t--)solve();
}
#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...