Submission #667546

#	Time	Username	Problem	Language	Result	Execution time	Memory
667546		mmk	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	143 ms	1764 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 16e4+10;
int v[MAXN];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n,k;
    cin >> n >> k;
    for(int i = 0; i < n+k; i++)
        cin >> v[i];
    sort(v,v+(n+k));
    int curini, curfim;
    int base;
    for(int j = 0; j < n+k; j++)
    {
        int aux = v[j];
        v[j] = -1;
        for(int i = 0; i < (n+1)/2; i++)
        {
            curini = v[i];
            curfim = v[n+k-i-1];
            if(curini == -1) curini = v[i+1];
            if(curfim == -1) curfim = v[n+k-i-2];
            if(i == 0) base = curfim+curini;
            else if(curini+curfim != base) break;
            if(i == (n+1)/2 -1)
            {
                for(int i = 0; i < n+k; i++)
                {
                    if(v[i] != -1)
                    {
                        cout << v[i];
                        if(i != n+k-1) cout << " ";
                    }
                }
                return 0;
            }
        }
        v[j] = aux;
    }
    for(int i = 0; i < n; i++)
        cout << i << " ";
}

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