Submission #1314391

#TimeUsernameProblemLanguageResultExecution timeMemory
1314391muhammad-ahmadTable Tennis (info1cup20_tabletennis)C++20
58 / 100
3095 ms4240 KiB
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'
#define all(x) x.begin(), x.end()

signed main(){
	int n, k; cin >> n >> k;
	n += k;
	int a[n + 1];
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= k + 1; i++){
		for (int j = n; j >= n - k; j--){
			if (i - 1 + n - j > k or i >= j) continue;
			// cout << i << ' ' << j << endl;
			int s = a[i] + a[j], c = 2;
			int l  = i + 1, r = j - 1;
			vector<int> idx = {a[i], a[j]};
			while (l < r){
				if (a[l] + a[r] == s){
					l++;
					r--;
					c += 2;
					idx.push_back(a[l - 1]);
					idx.push_back(a[r + 1]);
				}
				else if (a[l] + a[r] < s) l++;
				else r--;
			}
			sort(all(idx));
			if (c >= n - k) {for (auto k : idx) cout << k << ' '; cout << endl; return 0;}
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...