제출 #1319001

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

tabletennis

#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////////
//#define int long long
#define endl "\n"
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define INF 0x3F3F3F3F3F3F3F3F
#define ss second
#define ff first
#define pb push_back
#define ins insert
#define fori for(int i = 0 ; i < n ; i ++)
///////////////////////////////////////////////
const int sz = 2e3 + 5 ;
const int LG = 20 ;
const int N = 1e3 ;
const int mod = 1e9 + 7 ;
const int MAXM = 1e5 ;
///////////////////////////////////////////////
///////////////////////////////////////////////
void solve() {
  int n ;
  cin >> n ;
  int nc = n ;
  int k ;
  cin >> k ;
  n += k ; 
  vector<int>a(n) ;
  for(int i = 0 ; i < n ; i ++) {
    cin >> a[i] ;
  }
  sort(a.begin() , a.end()) ;
  for(int i = 0 ; i <= k ; i ++) {
    int l = i ;
    int r = nc + i - 1 ;
    int sum = a[l] + a[r] ;
    int cnt = 0 ;
    l = 0 ;
    r = n - 1 ;
    while(l < r) {
      int summ = a[l] + a[r] ;
      //cout << summ << endl ;
      if(summ == sum) {
        l ++ ;
        r -- ;
        cnt ++ ;
        continue ;
      } 
      //cout << summ << endl ;
      if(summ < sum) {
        l ++ ;
      }
      else {
        r -- ;
      }
    }
    //cout << rep[sum] << endl ;
    if(cnt * 2 >= nc) {
      //cout << sum << endl ;
      vector<int>ans ;
      int l = 0 ; 
      int r = n - 1 ;
      int say = 0 ;
      while(l < r and say < n / 2) {
        int summ = a[l] + a[r];
        if(summ == sum) {
          ans.push_back(a[l]);
          ans.push_back(a[r]);
          say++;
          l++;
          r--;
        }
        else if(summ < sum) {
          l++;
        }
        else {
          r--;
        }
      }
      sort(ans.begin() , ans.end()) ;
      for(int i = 0 ; i < ans.size() ; i ++) cout << ans[i] << ' ' ;
      return ;
    }
    //cout << endl ;
  }
  //cout << sum << endl ;
}
///////////////////////////////////////////////
///////////////////////////////////////////////
signed main() {
  IO ;
  int t = 1 ; // cin >> t ;
  while(t --) {
    solve() ;
    cout << endl ;
  }
}

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