제출 #675079

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

tabletennis

#include<bits/stdc++.h>
using namespace std;
int a[150100];
int n,k;
bool check(int x){
    int l = 1;
    int r = n;
    int cnt = 0;
    while (l < r){
        if (a[l] + a[r] > x){cnt++;r--;}
        else if (a[l] + a[r] < x){l++;cnt++;}
        else{l++;r--;}
        if (cnt > k)return 0;
    }
    return 1;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    cin>>n>>k;n += k;
    for (int i = 1;i <= n;i ++){
        cin>>a[i];
    }

    sort(a+1,a+1+n);
    vector <int> all;
    for (int i = 0;i <= k;i ++){
        for (int j = 0;j <= i;j ++){
            int l = j + 1;
            int r = n - (i - j);
            all.push_back(a[l] + a[r]);
        }
    }
    sort(all.begin(),all.end());
    all.resize(unique(all.begin(),all.end())-all.begin());
    for (auto x:all){
        if (check(x)){
            int l = 1;
            int r = n;
            vector <int> ans;
            while (l < r){
                if (a[l] + a[r] > x){r--;}
                else if (a[l] + a[r] < x){l++;}
                else {ans.push_back(a[l]);ans.push_back(a[r]);l++;r--;}
            }
            sort(ans.begin(),ans.end());
            for (auto y:ans)cout<<y<<' ';
            cout<<'\n';
            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