제출 #1231802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231802		durdona	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	3093 ms	6332 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 < k + 1; i ++){
        for (int j = n - 1; j < n + k; j ++){
            vector<int> ja;
            int s = arr[i] + arr[j];
            int l = 0, r = n + k - 1;
            while (l < r && ja.size() < n){
                if (arr[l] + arr[r] < s) l ++;
                else if (arr[l] + arr[r] > s) r --;
                else{
                    ja.push_back(arr[l]);
                    ja.push_back(arr[r]);
                    r --;
                    l ++;
                }
            }

            if (ja.size() == n){
                sort(ja.begin(), ja.end());
                for (int ii = 0; ii < n; ii ++) {
                    cout << ja[ii] << " ";
                }
                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: 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