제출 #745988

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

tabletennis

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

int main() {
    int n, k;
    cin >> n >> k;
    vector<long long> x(n+k);
    for (int i=0; i<n+k; i++) cin >> x[i];
    sort(x.begin(), x.end());
    vector<long long> ans(n);
    bool done=false;
    for (int i=0; (i<k+1 && !done); i++) {
        for (int j=n+k-1; (j>n-k+i-2 && !done); j--){
            long long sum=x[i]+x[j];
            int bcnt=0, l=i+1, r=j-1;
            while (r>l) {
                if (x[l]+x[r]>sum) {
                    r--;
                    bcnt++;
                }
                else if (x[l]+x[r]<sum){
                    l++;
                    bcnt++;
                }
                else {
                    r--;
                    l++;
                }
            }
            if (k>=bcnt+i+n+k-j-1) {
                done=true;
                int ansi=0, l=i, r=j;
                while (r>l) {
                    if (x[l]+x[r]>sum) {
                        r--;
                    }
                    else if (x[l]+x[r]<sum){
                        l++;
                    }
                    else {
                        if (ansi<n) {
                            ans[ansi++]=x[l];
                            ans[ansi++]=x[r];
                        }
                        r--;
                        l++;
                    }
                }
                //cerr << i << " " << j << "\n";
            }
        }
    }
    sort(ans.begin(), ans.end());
    for (int i=0; i<n; i++) cout << ans[i] << " ";
    return 0;
}

• 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