#include "bits/stdc++.h"
#define ll long long
using namespace std;
const ll mod = 1000000007;
signed main () {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("cowland.in","r",stdin);
// freopen("cowland.out","w",stdout);
int n, k;
cin >> n >> k;
vector<int> v;
for(int i = 0; i < n + k; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
map<int, int> mp;
for(int i = 0; i < n + k; i++)
mp[v[i]] = -1;
sort(v.begin(), v.end());
set<int> s;
for(int i = 0; i <= k; i++) {
int j = n + k - 1;
while(i < j && i + ((n + k) - j - 1) <= k)
s.insert(v[i] + v[j--]);
}
for(int x : s) {
int y = 0;
for(int i = 0; i < n + k && y < n; i++) {
if(mp[v[i]] && mp[x - v[i]]) {
y += 2;
mp[v[i]] = mp[x - v[i]] = x;
}
}
if(y >= n) {
set<int> ans;
for(int i = 0; i < n + k; i++) {
if(mp[v[i]] == x && mp[x - v[i]] == x) {
ans.insert(v[i]);
ans.insert(x - v[i]);
}
}
for(int i : ans)
cout << i << " ";
return 0;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
596 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
17 ms |
2464 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
239 ms |
28360 KB |
Output is correct |
2 |
Correct |
189 ms |
16456 KB |
Output is correct |
3 |
Correct |
352 ms |
48612 KB |
Output is correct |
4 |
Correct |
172 ms |
16496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
278 ms |
14924 KB |
Output is correct |
3 |
Correct |
1 ms |
524 KB |
Output is correct |
4 |
Correct |
50 ms |
6040 KB |
Output is correct |
5 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
32 ms |
1868 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
15 ms |
3396 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Incorrect |
18 ms |
1256 KB |
Unexpected end of file - int32 expected |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Execution timed out |
3072 ms |
229856 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
4052 KB |
Output is correct |
2 |
Execution timed out |
3067 ms |
237740 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |