#include <bits/stdc++.h>
#define int long long
using namespace std;
template<typename T> inline void read(T &x)
{
x = 0;
T f = 1;char ch = getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-')
{
f = -1,ch = getchar();
break;
}
ch = getchar();
}
while(ch>='0'&&ch<='9')
x = (x<<3)+(x<<1)+ch-48,ch = getchar();
x*=f;
}
template<typename T = int> inline T read()
{
T x;read(x);return x;
}
template<typename T> void write(T x)
{
if(x<0) x = -x,putchar('-');
if(x>9) write(x/10);
putchar(x%10+48);
}
template<typename T> inline void writen(T x)
{
write(x);
putchar(10);
}
const int N = 2e5+5;
unordered_map<int,int> mp;
int n,k,a[N];
bool vis[N];
void solve(int sum)
{
int l = 1,r = n+k,kpr = 0,kg = 0;
for(int i = 1;i<=n+k;i++)
vis[i] = 0;
while(l<r)
{
if((a[l]+a[r])<sum) l++,kpr++;
else
{
if((a[l]+a[r])==sum) vis[l] = vis[r] = 1,l++,r--,kg+=2;
else if((a[l]+a[r])>sum) r--,kpr++;
}
if(kpr>k) return;
if(kg==n)
{
for(int i = 1;i<=n+k;i++)
if(vis[i]) cout<<a[i]<<" ";
exit(0);
}
}
}
signed main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
read(n),read(k);
for(int i = 1;i<=n+k;i++)
read(a[i]);
for(int i = 1;i<=2*k+1;i++)
for(int j = max(n-k,i+1);j<=n+k;j++)
mp[a[i]+a[j]]++;
if((n+k)<=4*k) for(auto i:mp) solve(i.first);
else for(auto i:mp) if(i.second>=k) solve(i.first);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
352 KB |
Output is correct |
3 |
Correct |
1 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
828 KB |
Output is correct |
2 |
Correct |
18 ms |
4704 KB |
Output is correct |
3 |
Correct |
18 ms |
4448 KB |
Output is correct |
4 |
Correct |
16 ms |
4444 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
4444 KB |
Output is correct |
2 |
Correct |
16 ms |
4696 KB |
Output is correct |
3 |
Correct |
16 ms |
4696 KB |
Output is correct |
4 |
Correct |
16 ms |
4440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
600 KB |
Output is correct |
2 |
Correct |
1 ms |
860 KB |
Output is correct |
3 |
Correct |
3 ms |
864 KB |
Output is correct |
4 |
Correct |
4 ms |
864 KB |
Output is correct |
5 |
Correct |
3 ms |
864 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Correct |
0 ms |
352 KB |
Output is correct |
3 |
Correct |
1 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Correct |
1 ms |
352 KB |
Output is correct |
3 |
Correct |
1 ms |
352 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
352 KB |
Output is correct |
6 |
Correct |
1 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Correct |
18 ms |
4620 KB |
Output is correct |
3 |
Correct |
16 ms |
4704 KB |
Output is correct |
4 |
Correct |
16 ms |
4704 KB |
Output is correct |
5 |
Correct |
22 ms |
4444 KB |
Output is correct |
6 |
Correct |
16 ms |
4628 KB |
Output is correct |
7 |
Correct |
16 ms |
4692 KB |
Output is correct |
8 |
Correct |
17 ms |
4688 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
82 ms |
4968 KB |
Output is correct |
2 |
Correct |
143 ms |
28616 KB |
Output is correct |
3 |
Correct |
153 ms |
29792 KB |
Output is correct |
4 |
Correct |
121 ms |
27072 KB |
Output is correct |
5 |
Correct |
45 ms |
10440 KB |
Output is correct |
6 |
Correct |
26 ms |
4800 KB |
Output is correct |
7 |
Correct |
99 ms |
24768 KB |
Output is correct |
8 |
Correct |
139 ms |
26300 KB |
Output is correct |