제출 #718297

#제출 시각아이디문제언어결과실행 시간메모리
718297MrM7mdTable Tennis (info1cup20_tabletennis)C++17
100 / 100
290 ms3572 KiB
#include <bits/stdc++.h> using namespace std; // #define int long long #define endl '\n' #define F first #define S second #define pb push_back #define all(a) a.begin(),a.end() const int N=1e5; const int off=(1<<20); const int MOD = 1e9+7; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n,k; cin >> n >> k; int sz=n+k; int a[sz]; // map<int,bool>mp; for(int i=0;i<sz;i++){ cin >>a[i]; // mp[a[i]]=1; } // sort(a,a+sz); for(int i=0;i<=k;i++){ for(int j=0;j<=k-i;j++){ int ans=a[i]+a[sz-j-1]; int cur=i+j; vector<int>sml,big; int l=i,r=sz-j-1; while(l<=r){ if(l==r){ cur++; } else if(a[l]+a[r]==ans){ sml.pb(a[l]); big.pb(a[r]); l++; r--; } else if(a[l]+a[r]>ans){ cur++; r--; } else{ cur++; l++; } if(cur>k){ cur=-1; break; } } if(cur==k){ for(auto it:sml){ cout<<it<<' '; } for(int i=big.size()-1;i>=0;i--)cout<<big[i]<<' '; return 0; } // cout<<v.back()<<' '; } } // cout<<v.size()<<endl; } /* */
#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...