Submission #375051

# Submission time Handle Problem Language Result Execution time Memory
375051 2021-03-09T01:20:12 Z MilosMilutinovic Table Tennis (info1cup20_tabletennis) C++14
0 / 100
153 ms 17644 KB
#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;
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 620 KB Output not sorted
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1772 KB Output not sorted
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 153 ms 17644 KB Output not sorted
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Extra information in the output file
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output not sorted
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Extra information in the output file
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Extra information in the output file
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Extra information in the output file
2 Halted 0 ms 0 KB -