제출 #775672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775672		LeaRouse	Table Tennis (info1cup20_tabletennis)	C++14	9 / 100	3067 ms	226392 KiB

tabletennis

#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define ff first
#define ss second
#define ll long long
using namespace std;
const int MAX=2e5+5;
const ll INF=1e10;
int A[MAX];
int n;
unordered_map<int,int>m;
vector<int>v;
bool res(int suma){
	int ans=0;
	for(int i=0;i<n;i++){
		if(!m[A[i]] or ans==n/2)	continue;
		if(A[i]>suma)	continue;
		if(m[suma-A[i]]){
			m[suma-A[i]]--;
			m[A[i]]--;
			ans++;
			v.push_back(A[i]);
			v.push_back(suma-A[i]);
		}	
	}
	if(ans==n/2)	return true;
	else 	return false;
}

void go(){
	int k;	cin>>n>>k;
	for(int i=0;i<(n+k);i++){
		cin>>A[i];
		m[A[i]]++;
	}
	sort(A,A+n);
	for(int i=0;i<=k;i++){
		for(int j=0;j<=k;j++){
			int suma=A[i]+A[n-1-j];
			if(res(suma)){
				sort(v.begin(),v.end());
				for(auto it:v)	cout<<it<<" ";
				break;
			}
			else	v.clear();
		}
	}

}
 
int main(){
	fastio;
	go();
	return 0;
}

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