제출 #441237

#제출 시각아이디문제언어결과실행 시간메모리
441237Sarah_MokhtarTable Tennis (info1cup20_tabletennis)C++14
9 / 100
3105 ms225920 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define read freopen("in.txt","r",stdin);freopen("out.txt","w",stdout) const ll N=1e6+10,M=505,OO=1e16,mod=1e9+7; int n,k; ll a[N]; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n>>k; unordered_map<ll,int>cnt; for(int i=0;i<n+k;++i){ cin>>a[i]; cnt[a[i]]++; } vector<ll>ans; for(int i=0;i<=k;++i){ for(int j=n-1;j>=n-k;--j){ ll sum=a[i]+a[j]; int pairs=0; vector<ll>cur; for(int l=0;l<n;++l){ if(cnt[sum-a[l]]){ cur.push_back(a[l]); cur.push_back(sum-a[l]); ++pairs; cnt[sum-a[l]]--; cnt[a[l]]--; } if(pairs==n/2){ ans=cur; break; } } if(!ans.empty()) break; } if(!ans.empty()) break; } sort(ans.begin(),ans.end()); for(ll i:ans) cout<<i<<' '; cout<<"\n"; }
#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...