Submission #1144985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144985		Medetbek	Table Tennis (info1cup20_tabletennis)	C++20	24 / 100	3101 ms	89500 KiB

tabletennis

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <bits/stdc++.h>

#define ll long long
#define int long long
#define all(v) v.begin(), v.end()
#define nl '\n'
#define pb push_back
#define sz(s) (int)(s).size()
#define f first
#define s second
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;
const ll N = 1e5+10, MX = 1e18+1, MOD = 1e9 + 7;
void solve(){
    ll n, k;
    cin >> n >> k;
    ll m = n + k;
    ll a[m+1];
    for(int i = 1; i <= m; i++){
        cin >> a[i];
    }
    sort(a + 1, a + 1 + m);
    map <int, int> cnt;
    vector <int> v;
    set <pair <int, int> > sum;
    for(int i = 1; i <= min(k+k+k, m); i++){
        for(int j = min(m, k+k+k); j >= 1; j--){
            ll sm = a[i]+a[j];
            cnt[sm]++;
            v.pb(sm);
        }
    }
    for(auto x:v){
        if(cnt[x] > 0){
            sum.insert({cnt[x], x});
            cnt[x]=0;
        }
    }
    for(auto [y, x]:sum){
        ll l = 1, r = m; 
        vector <int> ans;
        while(l < r){
            if(a[l] + a[r] > x){
                r--;
            }else if(a[l] + a[r] < x){
                l++;
            }else{
                ans.pb(a[l]);
                ans.pb(a[r]);
                l++;
                r--;
            }
        }
        if(sz(ans) >= n){
            sort(all(ans));
            for(int i = 0; i < n; i++){
                cout << ans[i] << " ";
            }
            return;
        }
    }
}
main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    ll ql =1;
	 while(ql--){
	    solve();
	}
}

Compilation message (stderr)

tabletennis.cpp:66:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   66 | main(){
      | ^~~~

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