제출 #1131242

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131242		jpfr12	Table Tennis (info1cup20_tabletennis)	C++20	9 / 100	18 ms	2116 KiB

tabletennis

#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long int ull;
using namespace std;
const ll MOD = (ll)1e9+7;
int MAXN = 1e6;

//classes


//global
int N, K;
vector<int> vec;


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("hps.in");
  //ofstream fout("hps.out");
  //stop
  cin >> N >> K;
  vec.assign(N+K, 0);
  for(int& i: vec) cin >> i;
  sort(vec.begin(), vec.end());
  vector<ll> prefix(N+K+1, 0);
  for(int i = 0; i < N+K; i++){
    prefix[i+1] = prefix[i] + vec[i];
  }
  int left = 1;
  for(int right = 1; right <= N+K; right++){
    while(right-left+1 > N){
      left++;
    }
    if(right-left+1 == N){
      ll sum = prefix[right]-prefix[left-1];
      if((vec[right-1]+vec[left-1])*(N/2) == sum ){
        for(int i = left-1; i < right; i++){
          cout << vec[i] << " ";
        }
        cout << '\n';
        return 0;
      }
    }
  }
  return 0;
}

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