#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 2e5 + 7;
int arr[mxN];
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
//bitset<2000000001> in;
map<int,bool> in;
for (int i = 0; i < n + k; ++i) {
cin >> arr[i];
in[arr[i]] = true;
}
map<int,int> freq;
for (int i = 0; i < k + min(k, n); ++i) {
for (int j = n + k - 1; j >= max(0LL, n - k) && j > i; --j) {
int sum = arr[i] + arr[j];
freq[sum]++;
}
}
int mx = 0, sum = 0;
for (auto p : freq) {
if (p.second > mx) {
mx = p.second;
sum = p.first;
}
}
vector<int> nums;
for (int l = 0; l < n + k; ++l) {
if (sum - arr[l] >= 0 && in[sum - arr[l]]) {
nums.push_back(arr[l]);
}
}
for (int l = 0; l < n; ++l) {
cout << nums[l] << ' ';
}
cout << "\n";
}
// 1 2 1 2 3
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
596 KB |
Output not sorted |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
2132 KB |
Output is correct |
2 |
Incorrect |
83 ms |
21008 KB |
Output not sorted |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
70 ms |
13708 KB |
Output is correct |
2 |
Correct |
71 ms |
13676 KB |
Output is correct |
3 |
Runtime error |
79 ms |
38868 KB |
Execution killed with signal 11 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
852 KB |
Output is correct |
2 |
Correct |
3 ms |
1236 KB |
Output is correct |
3 |
Correct |
3 ms |
1236 KB |
Output is correct |
4 |
Correct |
3 ms |
1236 KB |
Output is correct |
5 |
Correct |
3 ms |
1236 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 |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Incorrect |
1 ms |
468 KB |
Output not sorted |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
70 ms |
13724 KB |
Output is correct |
3 |
Correct |
69 ms |
13624 KB |
Output is correct |
4 |
Correct |
68 ms |
13660 KB |
Output is correct |
5 |
Correct |
68 ms |
13608 KB |
Output is correct |
6 |
Correct |
73 ms |
13700 KB |
Output is correct |
7 |
Correct |
71 ms |
13672 KB |
Output is correct |
8 |
Correct |
69 ms |
13676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
6112 KB |
Output is correct |
2 |
Correct |
368 ms |
50488 KB |
Output is correct |
3 |
Correct |
322 ms |
52736 KB |
Output is correct |
4 |
Correct |
240 ms |
47424 KB |
Output is correct |
5 |
Correct |
139 ms |
23832 KB |
Output is correct |
6 |
Correct |
99 ms |
15008 KB |
Output is correct |
7 |
Correct |
235 ms |
43908 KB |
Output is correct |
8 |
Correct |
217 ms |
46864 KB |
Output is correct |