#include<bits/stdc++.h>
using namespace std;
long long 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<long long int> v;
long long 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 ()
{
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |