제출 #1232158

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232158		khome	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	3093 ms	3260 KiB

tabletennis

#include <bits/stdc++.h>

using namespace std;

const int inf = 1e9;

void solve(){
    int n, k; cin >> n >> k;
    vector<int> a(n + k);
    for (int i = 0; i < n + k; i++ ) {cin >> a[i];}

    // sort(a.begin(), a.end());
    auto check = [&](int x, int L, int R) -> void {
        int l = L, r = R, f = 0;
        while(l < r) {
            if(f == n) break;
            if(a[l] + a[r] == x) {
                f+=2;
                l++;
                r--;
            } else if(a[l] + a[r] > x) {
                r--;
            } else {
                l++;
            }
        }

        if (f == n){
            vector<int> v;
            int l = L, r = R;
            while(l < r) {
                if (v.size() >= n) break;
                if(a[l] + a[r] == x) {
                    v.push_back(a[l]);
                    v.push_back(a[r]);
                    l++;
                    r--;
                } else if(a[l] + a[r] > x) {
                    r--;
                } else {
                    l++;
                }
            }
            
            sort(v.begin(), v.end());
            for (int i : v) cout << i << ' '; cout << endl;
            exit(0);
        }
        return;
    };

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

}

signed main(){
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)solve();
}



// 5 8 10 15 19
//   ^        ^
// 
// 23

• 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: 0 / 13