#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pw(x) (1ll << x)
#define pb push_back
#define endl '\n'
#define sz(x) (int)((x).size())
using namespace std;
template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef pair <int, int> pii;
inline void solve () {
int n, k; cin >> n >> k;
vector <int> a (n + k);
for (auto &i : a) cin >> i;
sort(all(a));
set <int> used;
for (int i = 0; i < k + 1; ++i) {
for (int j = n + k - 1; j >= n - 2; --j) {
if (used.find(a[i] + a[j]) != used.end()) continue;
int s = a[i] + a[j];
used.insert(s);
int l = i + 1, r = j - 1;
vector <int> ans; ans.reserve(n);
ans.pb(a[i]); ans.pb(a[j]);
while (l <= r && sz(ans) < n) {
if (r - l + 1 + sz(ans) < n) break;
if (a[l] + a[r] == s) {
ans.pb(a[l]); ans.pb(a[r]);
++l, --r;
}
else if (a[l] + a[r] < s) ++l;
else --r;
}
if (sz(ans) == n) {
sort(all(ans));
for (auto x : ans) cout << x << " ";
return;
}
}
}
assert(0);
}
signed main () {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // LOCAL
int t = 1; //cin >> t;
while (t--) solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
664 KB |
Output is correct |
2 |
Correct |
33 ms |
3004 KB |
Output is correct |
3 |
Correct |
34 ms |
3028 KB |
Output is correct |
4 |
Correct |
36 ms |
2988 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
3100 KB |
Output is correct |
2 |
Correct |
34 ms |
2976 KB |
Output is correct |
3 |
Correct |
34 ms |
3000 KB |
Output is correct |
4 |
Correct |
33 ms |
2996 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
724 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
468 KB |
Output is correct |
5 |
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 |
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 |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
34 ms |
3100 KB |
Output is correct |
3 |
Correct |
37 ms |
3016 KB |
Output is correct |
4 |
Correct |
34 ms |
2976 KB |
Output is correct |
5 |
Correct |
35 ms |
3052 KB |
Output is correct |
6 |
Correct |
33 ms |
3144 KB |
Output is correct |
7 |
Correct |
33 ms |
3052 KB |
Output is correct |
8 |
Correct |
32 ms |
3000 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
96 ms |
10196 KB |
Output is correct |
3 |
Correct |
34 ms |
4344 KB |
Output is correct |
4 |
Correct |
68 ms |
7880 KB |
Output is correct |
5 |
Correct |
34 ms |
4340 KB |
Output is correct |
6 |
Correct |
34 ms |
4464 KB |
Output is correct |
7 |
Correct |
64 ms |
6572 KB |
Output is correct |
8 |
Correct |
35 ms |
4364 KB |
Output is correct |