Submission #1366749

#	Time	Username	Problem	Language	Result	Execution time	Memory
1366749		yeuler	Table Tennis (info1cup20_tabletennis)	C++20	9 / 100	3094 ms	13016 KiB

tabletennis

#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k; cin >> n >> k;
    vector<ll> ar(n+k+1), val;
    map<ll, bool> frek;
    for (int i = 1; i <= n+k; i++){
        cin >> ar[i];
        frek[ar[i]] = 1;
    }
    sort(ar.begin()+1, ar.end());
    for (int i = 1; i <= k+1; i++){
        int en = n-i+1, st = max(i+1,en-k);
        for (int j = st; j <= en; j++){
            ll cur = ar[i]+ar[j];
            val.pb(cur);
        }
    }
    ll sum = 0;
    for (ll x : val){
        int cnt = 0;
        for (int i = 1; i <= n+k; i++){
            ll rem = x-ar[i];
            if (frek.count(rem)) cnt++;
        }
        if (cnt >= n){
            sum = x;
            break;
        }
    }
    set<ll> ele;
    for (int i = 1; i <= n+k; i++){
        ll rem = sum-ar[i];
        if (frek.count(rem)) ele.insert(ar[i]);
    }
    for (int i = 1; i <= n; i++){
        ll cur = *ele.begin();
        cout << cur << " ";
        ele.erase(ele.begin());
    }
    cout << "\n";
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 9 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13