#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e9;
void solve(){
int n, k; cin >> n >> k;
vector<int> a(n + k);
for (int i = 0; i < n + k; i++ ) cin >> a[i];
sort(a.begin(), a.end());
auto check = [&](int x) -> void {
vector<int> v;
for (int i : a) {
if (v.size() >= n) break;
auto it = lower_bound(a.begin(), a.end(), x - i);
if (it != a.end() && *it == x - i && i != x - i) {
v.push_back(i);
v.push_back(x - i);
}
}
if (v.size() == n){
sort(v.begin(), v.end());
for (int i : v) cout << i << ' '; cout << endl;
exit(0);
}
return;
};
for (int i = 0; i < k + 1; i++ ) {
for (int j = i + n; j < n + k; j++) {
check(a[i] + a[j]);
}
}
// cout << "HERE" << endl;
}
signed main(){
cin.tie(0) -> sync_with_stdio(0);
int t = 1;
// cin >> t;
while (t--)solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |