Submission #1151378

#TimeUsernameProblemLanguageResultExecution timeMemory
1151378boropotoTable Tennis (info1cup20_tabletennis)C++20
0 / 100
54 ms844 KiB
#include<bits/stdc++.h> using namespace std; int n,k,a[160000]; void read() { cin>>n>>k; for(int i=1; i<=n+k; i++) { cin>>a[i]; } } bool check(int l,int r) { vector<int> v; int brg=n/2,brk=l+n+k-r-1,sumlr=a[l]+a[r]; while(brg>0&&l<r) { if(a[l]+a[r]==sumlr) { brg--; v.push_back(a[l]); v.push_back(a[r]); l++; r--; } else { if(sumlr<a[l]+a[r]) { r--; brk++; } else { if(sumlr>a[l]+a[r]) { l++; brk++; } } } if(brk>k) { return false; } } sort(v.begin(),v.end()); for(int i=0;i<v.size();i++) { cout<<v[i]<<' '; } exit(0); } int main () { read(); for(int i=1; i<=k; i++) { for(int j=0; j+i<=k; j++) { check(i,n+k-j); } } 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...