제출 #745904

#제출 시각아이디문제언어결과실행 시간메모리
745904vjudge1Table Tennis (info1cup20_tabletennis)C++17
20 / 100
75 ms4400 KiB
// Source: https://usaco.guide/general/io

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

int main() {
	int n, k; cin>>n>>k;
	vector<ll> v(n+k);
	
	for(ll & a: v)cin>>a;

	sort(v.begin(), v.end());

	bool valami = false;
	for(int i = 0; i < n; ++i){
		if(v[i] + v[n-i-1] != v[0] + v[n-1]){
			valami = true;
			//cerr<<v[i]<<' '<<v[n-1+1]<<endl;
		}
	}

	if(!valami)for(int i = 0; i < n; ++i)cout<<v[i]<<' ';
	else for(int i = 0; i < n; ++i)cout<<v[i+1]<<' ';
}
#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...