Submission #865873

#TimeUsernameProblemLanguageResultExecution timeMemory
865873Darren0724Table Tennis (info1cup20_tabletennis)C++17
9 / 100
3079 ms4648 KiB
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));

int main(){
    int n,k;cin>>n>>k;
    vector<int> v(n+k);
    for(int i=0;i<n+k;i++){
        cin>>v[i];
    }
    int flag=0;
    auto check=[&](int p)->void {
        int j=n+k-1;
        int cnt=0;
        vector<int> ans;
        for(int i=0;i<n+k;i++){
            while(i<j&&v[i]+v[j]>p){
                j--;
            }
            if(i>=j){
                break;
            }
            if(i<j&&v[i]+v[j]==p){
                ans.push_back(v[i]);
                ans.push_back(v[j]);
                cnt+=2;
                j--;
            }
        }
        //cout<<ans.size()<<endl;
        if(cnt>=n){
            sort(ans.begin(),ans.begin()+n);
            for(int i=0;i<n;i++){
                cout<<ans[i]<<' ';
            }
            cout<<endl;
            flag=1;
        }
    };
    for(int i=0;i<min(k+1,n);i++){
        for(int j=max(0,n-k-1);j<n;j++){
            check(v[i]+v[j]);
            if(flag){
                return 0;
            }
        }
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...