제출 #1231813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231813		durdona	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3094 ms	8516 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

#define int long long

void solve() {
    int n, k; cin >> n >> k;
    vector<int> arr(n + k);
    for (int i = 0; i < n + k; i ++) cin >> arr[i];
    for (int i = 0; i < n + k; i++) {
        for (int j = i + 1; j < n + k; j++) {
            int s = arr[i] + arr[j];
            multiset<int> ms(arr.begin(), arr.end());
            vector<int> ja;

            bool ok = true;
            while (ja.size() < n && !ms.empty()) {
                int katta = *ms.rbegin();
                ms.erase(ms.find(katta));
                int kerak = s - katta;
                auto it = ms.find(kerak);
                if (it == ms.end()) {
                    ok = false;
                    break;
                }
                ms.erase(it);
                ja.push_back(katta);
                ja.push_back(kerak);
            }

            if (ok && ja.size() == n) {
                sort(ja.begin(), ja.end());
                for (int x : ja) cout << x << " ";
                return;
            }
        }
    }
}

signed main(){
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }
}

• 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