Submission #1327302

#	Time	Username	Problem	Language	Result	Execution time	Memory
1327302		gdshirpeleng	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	2704 ms	1114112 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define in insert
#define pb push_back

void solve(){
    ll n,k;
    cin>>n>>k;
    vector<ll>v(n+k);
    ll lim=n+k;
    for(int i=0;i<lim;i++){
        cin>>v[i];
    }
    vector<pair<ll,pair<ll,ll>>>pairs;
    map<ll,ll>mp;
    for(int i=0;i<lim;i++){
        for(int j=i+1;j<lim;j++){
            mp[v[i]+v[j]]++;
            pairs.pb({v[i]+v[j],{v[i],v[j]}});
        }
    }
    sort(pairs.begin(),pairs.end());
    vector<pair<ll,pair<ll,ll>>>ans;
    for(int i=0;i<pairs.size();i++){
        if(mp[pairs[i].first]>=n/2){
            if(ans.size()<n/2){
                ans.pb(pairs[i]);
            }
            else{
                break;
            }
        }
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++){
        cout<<ans[i].second.first<<" "<<ans[i].second.second<<" ";
    }
}

int main(){
    solve();
    return 0;
}

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