제출 #375051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375051		MilosMilutinovic	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	153 ms	17644 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) {
		int i=0;
		for(int cnt=0; i<n&&cnt<n/2; ++i)
			if(i!=pos)
				cout << a[i] << " ", ++cnt;
		for(int j=n-1; j>=i; --j)
			if(i!=pos)
				cout << a[j] << " ";
		return 0;
	}
	for(int i=0; i<n/2; ++i)
		cout << a[i] << " ";
	for(int i=n-1; i>=n/2; --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