제출 #328954

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
328954		ThaiBaHung	Table Tennis (info1cup20_tabletennis)	C++14	100 / 100	90 ms	4632 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
const int N = 160003;
const int K = 403;
int n, k;
int a[N];

void solve(int lo, int hi, int sum)
{
    vector < int > res;
    int cur = 1;

    res.push_back(a[lo]), res.push_back(a[hi]);

    int i = lo + 1, j = hi - 1;
    int dem = hi - lo + 1 - n ;

    while (i < j && cur < n / 2 && dem >= 0)
    {
        if (a[i] + a[j] > sum) j--, dem--;
        if (a[i] + a[j] < sum) i++, dem--;
        if (a[i] + a[j] == sum)
        {
            cur++;
            res.push_back(a[i]);
            res.push_back(a[j]);
            i++; j--;
        }

        if (cur == n / 2) break;
    }

    if (cur == n / 2)
    {
        sort(res.begin(), res.end());

        for (int u : res)
            cout << u << " ";
        exit(0);
    }

    return;
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> k;

    int m = n + k;

    for (int i = 1; i <= m; i++)
        cin >> a[i];

    sort(a + 1, a + m + 1);

    for (int i = 1; i <= k + 1; i++)
    {
        for (int j = i + n - 1; j <= m; j++)
        {
            solve(i, j, a[i] + a[j]);
        }
    }
}

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