Submission #1317723

#	Time	Username	Problem	Language	Result	Execution time	Memory
1317723		tuncay_pasha	Table Tennis (info1cup20_tabletennis)	C++20	20 / 100	32 ms	5424 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
const int B = 1e3 + 5;
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int m = n + k;
  vector < int > a(m + 1);
  map < int , int > is;
  for(int i = 1; i <= m; i++){
    cin >> a[i];
  }
  sort (a.begin(), a.end());
  k += (k == 1);
  vector < int > v;
  map < int, int > mp;
  for(int i = 1; i <= min(k + 4, m); i++){  
    for(int j = m; j >= max(m - k - 4, 1); j--){
      v.push_back(a[i] + a[j]);
    }
  }
  for(auto i : v)mp[i] += 2;
  int mx = 0;
  vector < int > sums;
  for(auto [x, cnt] : mp){
    if(cnt >= mx){
      mx = cnt;
    }
  }
  for(auto [x, cnt] : mp){
    if (cnt == mx) {
      sums.push_back(x);
    }
  }
  sort(sums.rbegin(), sums.rend());
  for(auto sum : sums){
    int l = 1, r = m;
    deque < int > dq;
    while (l < r || dq.size() < n) {
      if (a[l] + a[r] == sum) {
        dq.push_back(a[l++]);
        dq.push_back(a[r--]);
      } else if (a[l] + a[r] > sum) {
        --r;
      } else {
        ++l;
      }
    }
    if (dq.size() == n) {
      sort (dq.begin(), dq.end());
      for (int &i : dq) {
        cout << i << ' ';
      }
      return 0;
    }
  }
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 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