제출 #441246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441246		Sarah_Mokhtar	Table Tennis (info1cup20_tabletennis)	C++14	72 / 100	3059 ms	18544 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define read freopen("in.txt","r",stdin);freopen("out.txt","w",stdout)
const ll N=1e6+10,M=505,OO=1e16,mod=1e9+7;
int n,k;
ll a[N];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    for(int i=0;i<n+k;++i){
        cin>>a[i];
    }
    vector<ll>ans;
    for(int i=0;i<=k;++i){
        for(int j=n+k-1;j>=n-1;--j){
            unordered_map<ll,int>cnt;
            for(int p=0;p<n+k;++p){
                cnt[a[p]]++;
            }
            ll sum=a[i]+a[j];
            int pairs=0;
            vector<ll>cur;
            for(int l=0;l<n+k;++l){
                if(cnt[sum-a[l]]&&cnt[a[l]]){
                    cur.push_back(a[l]);
                    cur.push_back(sum-a[l]);
                    ++pairs;
                    cnt[sum-a[l]]--;
                    cnt[a[l]]--;
                }
                if(pairs==n/2){
                    ans=cur;
                    break;
                }
            }
            if(!ans.empty()) break;
        }
        if(!ans.empty()) break;
    }
    sort(ans.begin(),ans.end());
    for(ll i:ans) cout<<i<<' ';
    cout<<"\n";
}

• 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: 0 / 15
• Subtask 8: 0 / 13