제출 #1319816

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319816		husuuu	Table Tennis (info1cup20_tabletennis)	C++20	100 / 100	375 ms	23684 KiB

tabletennis

//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());
	map<int,int>cnt;
	int mx=-1;
	for(int i=0;i<min(500,n+k);i++){
		for(int j=max(0,n-500);j<n+k;j++){
			cnt[a[i]+a[j]]++;
			mx=max(mx,cnt[a[i]+a[j]]);
		}
	}
	set<int>all;
	for(int i=0;i<min(500,n+k);i++){
		for(int j=max(0,n-500);j<n+k;j++){
			if(cnt[a[i]+a[j]]==mx) all.insert(a[i]+a[j]);
		}
	}
	for(int vl:all){
		vector<int>v1;
		int l=0,r=n+k-1;
		while(l<r){
			if(a[l]+a[r]==vl){
				v1.push_back(a[l]);
				v1.push_back(a[r]);
				++l;
				--r;
			}
			else if(a[l]+a[r]>vl) --r;
			else ++l;
            if(v1.size() == n) break ;
		}
		if(v1.size()==n){
			sort(v1.begin(),v1.end());
            for(int j : v1) cout << j << ' ' ;
			return 0;
		}
	}
}

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