# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523366 | Ahmed2me | Table Tennis (info1cup20_tabletennis) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define sp ' '
using namespace std;
ll t=1,n,m,a[200020];
bool good(ll sum)
{
ll i=1,j=n+m;
ll cnt=false;
while(i<j)
{
if(a[i]+a[j]==sum){cnt++;i++;j--;continue;}
if(a[i]+a[j]>sum){j--;continue;}
if(a[i]+a[j]<sum){i++;continue;}
}
return cnt>=(n/2);
}
void print_ans(ll sum)
{
ll i=1;ll j=n+m;
vector<ll>ans;
ll counter=false;
while(i<j)
{
if(a[i]+a[j]==sum){if(counter<(n/2))ans.push_back(a[i]);ans.push_back(a[j]);i++;j--;continue;}
if(a[i]+a[j]>sum){j--;continue;}
if(a[i]+a[j]<sum){i++;continue;}
}
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++){cout<<ans[i]<<sp;}
return;
}
void solve()
{
cin>>n>>m;
for(int i=1;i<=n+m;i++){cin>>a[i];}
set<int>st;sort(a+1,a+n+m+1);
for(int i=1;i<=min(n,2*m);i++)
{
for(int j=max(1ll,(n-m+1);j<=n+m;j++)
{
st.insert(a[i]+a[j]);
}
}
for(auto I:st){if(good(I)){print_ans(I);return;}}
}
int main()
{
ios::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
while(t--){solve();}return 0;
}