/*
* author: NeroZein
* created: 01.02.2023 12:23:57
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n + k);
map<int, bool> mp;
for (int i = 0; i < n + k; ++i) {
cin >> a[i];
mp[a[i]] = 1;
}
sort(a.begin(), a.end());
for (int i = 0; i <= k; ++i) {
for (int j = n + k - 1; j > i; --j) {
int cnt = i + (n + k - j - 1);
if (cnt > k) {
break;
}
int tar = a[i] + a[j];
for (int x = i + 1; x < j; ++x) {
if (!mp.count(tar - a[x])) {
cnt++;
}
}
if (cnt == k) {
//deb(
vector<int> ans;
for (int x = i; x <= j; ++x) {
if (mp.count(tar - a[x])) {
ans.push_back(a[x]);
}
}
for (int x : ans) {
cout << x << ' ';
}
return 0;
}
}
}
return 0;
}
# |
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 |
2 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
1840 KB |
Output is correct |
2 |
Correct |
113 ms |
11580 KB |
Output is correct |
3 |
Correct |
96 ms |
11580 KB |
Output is correct |
4 |
Correct |
94 ms |
11560 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
149 ms |
11556 KB |
Output is correct |
2 |
Correct |
112 ms |
11616 KB |
Output is correct |
3 |
Correct |
151 ms |
11520 KB |
Output is correct |
4 |
Correct |
123 ms |
11572 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
11 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
6 ms |
328 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
324 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
12 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
7 ms |
444 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
4 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
2755 ms |
11564 KB |
Output is correct |
3 |
Correct |
334 ms |
11596 KB |
Output is correct |
4 |
Correct |
1911 ms |
11544 KB |
Output is correct |
5 |
Correct |
193 ms |
11548 KB |
Output is correct |
6 |
Correct |
524 ms |
11576 KB |
Output is correct |
7 |
Correct |
1769 ms |
11560 KB |
Output is correct |
8 |
Correct |
177 ms |
11556 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Execution timed out |
3080 ms |
9396 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |