제출 #1319818

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

tabletennis

#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,k;
    cin>>n>>k;
    int a[n + k];
    for (int i = 0; i < n + k; i++) {
        cin>>a[i];
    }
    if(n == 2){
      if(a[0] == a[1]){
        cout<<a[0]<< " " << a[1];
        return 0;
      }
      if(a[1] == a[2]){
        cout<<a[1]<< " " << a[2];
        return 0;
      }
      if(a[0] == a[2]){
        cout<<a[0]<< " " << a[2];
        return 0;
      }
    }
    for (int i = -1; i < n; i++) {
        if(i > -1)
            swap(a[i], a[n + k - 1]);
        int b[n];
        for (int j = 0; j < n; j++) {
            b[j] = a[j];
        }
        sort(b, b + n);
        int ans1 = 0, ans2 = 0, l = 0, r = n - 1, cnt = 0, x = b[0] + b[n - 1], ok = 1;
        for (int i = 0; i < n; i++) {
            if(x != (b[i] + b[n - i - 1])){
                ok = 0;
                break;
            }
        }
        //while(l < r){
        //    if(cnt % 2 ==0)
        //        ans1 += (b[l] + b[r]);
        //    else
        //        ans2 += (b[l] + b[r]);
        //    l++;
        //    r--;
        //    cnt ++;
        //}
        if(ok){
            for (int j = 0; j < n; j++) {
                std::cout << a[j] << " ";
            }
            return 0;
        }
        if(i > -1)
            swap(a[i], a[n + k - 1]);
    }

    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