Submission #375050

#	Time	Username	Problem	Language	Result	Execution time	Memory
375050		MilosMilutinovic	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	154 ms	18024 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

const int mxN=2e5;
int n, k, a[mxN];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> k;
	n+=k;
	map<int, int> mp;
	for(int i=0; i<n; ++i)
		cin >> a[i], ++mp[a[i]];
	sort(a, a+n);
	int cnt=0, pos=1;
	for(int i=0; i<n; ++i) {
		if(mp[a[i]]==0)
			continue;
		int nd=a[0]+a[n-1]-a[i];
		if(mp[nd]==0)
			++cnt, pos=i;
		--mp[a[i]], --mp[nd];
	}
	//cout << cnt << " " << pos << endl;
	if(cnt==1) {
		for(int i=0; i<n; ++i)
			if(i!=pos)
				cout << a[i] << " ";
		return 0;
	}
	for(int i=0; i<n-1; ++i)
		cout << a[i] << " ";
	return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13