제출 #1319787

#제출 시각아이디문제언어결과실행 시간메모리
1319787ElayV13Table Tennis (info1cup20_tabletennis)C++17
53 / 100
3093 ms8196 KiB
//g++ -o sol sol.cpp
//cd C:\Users\Asus-1\OneDrive\Desktop
#include <bits/stdc++.h>
using namespace std;
int n,k;
vector<int>a;
signed main(){
        ios_base::sync_with_stdio();
        cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	a.resize(n+k);
	for(int i=0;i<n+k;i++) cin>>a[i];
	sort(a.begin(),a.end());
	set<int>pos;
	for(int i=0;i<k;i++) for(int j=n-1;j<n+k;j++) pos.insert(a[i]+a[j]);
	for(int vl:pos){
				vector<int>v1,v2;
				int l=0,r=n+k-1;
				while(l<r){
					if(a[l]+a[r]==vl){
						v1.push_back(a[l]);
						v2.push_back(a[r]);
						++l;
						--r;
					}
					else if(a[l]+a[r]>vl) --r;
					else ++l;
				}
				if(v1.size()+v2.size()>=n){
					for(int x:v1)cout<<x<<' ';
					reverse(v2.begin(),v2.end());
					for(int x:v2)cout<<x<<' ';
					return 0;
				}
		}
}
#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...