#include "bits/stdc++.h"
#define ll long long
using namespace std;
const ll mod = 1000000007;
int b[150001], cnt[150001];
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;
set<int> ss;
for(int i = 0; i < n + k; i++) {
int x;
cin >> x;
ss.insert(x);
v.push_back(x);
}
map<int, int> c;
int o = 1;
for(int i : ss)
c[i] = o++;
for(int i = 0; i < n + k; i++)
cnt[c[v[i]]]++;
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; i++) {
if(cnt[c[v[i]]] - b[c[v[i]]] && x - v[i] >= 0 && cnt[c[x - v[i]]] - b[c[x - v[i]]]) {
b[c[v[i]]]++, b[c[x - v[i]]]++;
y += 2;
if(y == n)
break;
}
}
if(y >= n) {
set<int> ans;
for(int i = 0; i < n + k; i++) {
if(b[c[v[i]]]) {
b[c[v[i]]]--;
ans.insert(v[i]);
}
}
for(int i : ans)
cout << i << " ";
return 0;
}
for(int i = 0; i < n + k; i++)
b[c[v[i]]] = 0;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
724 KB |
Output is correct |
2 |
Correct |
2 ms |
596 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
3468 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
356 ms |
36644 KB |
Output is correct |
2 |
Correct |
217 ms |
24660 KB |
Output is correct |
3 |
Correct |
622 ms |
56844 KB |
Output is correct |
4 |
Correct |
193 ms |
24616 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
459 ms |
14264 KB |
Output is correct |
3 |
Correct |
1 ms |
596 KB |
Output is correct |
4 |
Correct |
80 ms |
3112 KB |
Output is correct |
5 |
Correct |
1 ms |
596 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
73 ms |
1956 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
4 |
Correct |
26 ms |
3536 KB |
Output is correct |
5 |
Correct |
2 ms |
596 KB |
Output is correct |
6 |
Incorrect |
40 ms |
1372 KB |
Unexpected end of file - int32 expected |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Runtime error |
194 ms |
46040 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
4036 KB |
Output is correct |
2 |
Runtime error |
210 ms |
54040 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |