Submission #525266

#TimeUsernameProblemLanguageResultExecution timeMemory
525266ksu2009enTable Tennis (info1cup20_tabletennis)C++17
20 / 100
120 ms4336 KiB
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;


int main(){
    ll n, k;
    cin >> n >> k;

    vector<ll>a(n + k);

    for(int i = 0; i < n + k; i++)
        cin >> a[i];

    ll sum = 0;
    for(auto i: a)
        sum += i;

    sort(a.begin(), a.end());

    for(int i = 0; i < n + 1; i++){
        ll sum2 = sum - a[i];

        ll mn = a[0];
        if(i == 0)
            mn = a[1];

        ll mx = a[n + k - 1];
        if(i == n + k - 1)
            mx = a[n + k - 2];

        ll bl = sum2 / (n / 2);
        if(sum2 % (n / 2) != 0)
            continue;

        if(mn + mx < bl || mx >= bl)
            continue;

        for(int j = 0; j < n + k; j++){
            if(j == i)
                continue;
            cout << a[j] << ' ';
        }
        cout << endl;
        return 0;
    }


    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...