#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=2e5+5;
const int inf=1e9;
int n, k;
int a[mxn];
bool cnt[2 * inf + 1];
bool check(int tot) {
int pair = 0;
for(int i = 1; i <= n + k; i++) {
if(tot - a[i] >= 0 && cnt[tot - a[i]]) pair++;
}
return pair >= n;
}
void print(int tot) {
int pair = 0;
vector<int> v;
for(int i = 1; i <= n + k && pair < n; i++) {
if(tot - a[i] >= 0 && cnt[tot - a[i]]) {
pair += 2;
v.push_back(a[i]);
v.push_back(tot - a[i]);
}
}
sort(v.begin(), v.end());
for(int i : v) cout<<i<<" ";
cout<<endl;
}
int main() {
cin >> n >> k;
for(int i = 1; i <= n + k; i++) {
cin >> a[i];
cnt[a[i]] = 1;
}
for(int i = 1; i <= min(n + k, k + 2); i++) {
for(int j = n + k; j >= max(1, n - 2); j--) {
if(check(a[i] + a[j])) {
print(a[i] + a[j]);
return 0;
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
3540 KB |
Output is correct |
2 |
Correct |
5 ms |
6996 KB |
Output is correct |
3 |
Correct |
5 ms |
6996 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
49 ms |
81504 KB |
Output is correct |
2 |
Correct |
339 ms |
428476 KB |
Output is correct |
3 |
Correct |
281 ms |
428992 KB |
Output is correct |
4 |
Correct |
288 ms |
430036 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
292 ms |
397724 KB |
Output is correct |
2 |
Correct |
276 ms |
428472 KB |
Output is correct |
3 |
Correct |
302 ms |
498432 KB |
Output is correct |
4 |
Correct |
288 ms |
437224 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
2644 KB |
Output is correct |
2 |
Correct |
4 ms |
852 KB |
Output is correct |
3 |
Correct |
8 ms |
2900 KB |
Output is correct |
4 |
Correct |
9 ms |
2388 KB |
Output is correct |
5 |
Correct |
9 ms |
2900 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
724 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
980 KB |
Output is correct |
2 |
Correct |
4 ms |
1876 KB |
Output is correct |
3 |
Correct |
18 ms |
6872 KB |
Output is correct |
4 |
Correct |
14 ms |
4800 KB |
Output is correct |
5 |
Correct |
24 ms |
9120 KB |
Output is correct |
6 |
Correct |
17 ms |
9392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
980 KB |
Output is correct |
2 |
Correct |
853 ms |
429268 KB |
Output is correct |
3 |
Correct |
309 ms |
423960 KB |
Output is correct |
4 |
Correct |
600 ms |
458432 KB |
Output is correct |
5 |
Correct |
298 ms |
435740 KB |
Output is correct |
6 |
Correct |
138 ms |
31808 KB |
Output is correct |
7 |
Correct |
656 ms |
549856 KB |
Output is correct |
8 |
Correct |
301 ms |
422364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
39 ms |
3876 KB |
Output is correct |
2 |
Execution timed out |
3079 ms |
428160 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |