#include <bits/stdc++.h>
using namespace std;
#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];
unordered_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>v;
for(int w=i;w<=sz-j-1;w++){
if(a[w]!=ans-a[w]){
if(!mp[ans-a[w]]){
if(cur<k&&cur>=0)cur++;
else cur=-1;
}
else v.pb(a[w]);
}
else{
if(cur<k&&cur>=0)cur++;
else cur=-1;
}
if(cur==-1)break;
}
if(cur==k){
for(auto it:v){
cout<<it<<' ';
}
return 0;
}
// cout<<v.back()<<' ';
}
}
// cout<<v.size()<<endl;
}
/*
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
1744 KB |
Output is correct |
2 |
Correct |
64 ms |
10532 KB |
Output is correct |
3 |
Correct |
77 ms |
10512 KB |
Output is correct |
4 |
Correct |
69 ms |
10552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
58 ms |
10560 KB |
Output is correct |
2 |
Correct |
68 ms |
10648 KB |
Output is correct |
3 |
Correct |
63 ms |
10632 KB |
Output is correct |
4 |
Correct |
62 ms |
10560 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
576 KB |
Output is correct |
2 |
Correct |
19 ms |
5568 KB |
Output is correct |
3 |
Correct |
1 ms |
596 KB |
Output is correct |
4 |
Correct |
22 ms |
6040 KB |
Output is correct |
5 |
Correct |
1 ms |
596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
320 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
320 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
456 KB |
Output is correct |
5 |
Correct |
1 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
57 ms |
10640 KB |
Output is correct |
3 |
Correct |
72 ms |
10560 KB |
Output is correct |
4 |
Correct |
57 ms |
10568 KB |
Output is correct |
5 |
Correct |
64 ms |
10596 KB |
Output is correct |
6 |
Correct |
67 ms |
10800 KB |
Output is correct |
7 |
Correct |
70 ms |
10644 KB |
Output is correct |
8 |
Correct |
65 ms |
10516 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
3428 KB |
Output is correct |
2 |
Correct |
703 ms |
46260 KB |
Output is correct |
3 |
Correct |
84 ms |
14540 KB |
Output is correct |
4 |
Correct |
2397 ms |
223128 KB |
Output is correct |
5 |
Correct |
73 ms |
13812 KB |
Output is correct |
6 |
Correct |
703 ms |
10940 KB |
Output is correct |
7 |
Correct |
602 ms |
48028 KB |
Output is correct |
8 |
Correct |
88 ms |
13972 KB |
Output is correct |