제출 #499564

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499564		bigo	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	134 ms	7804 KiB

tabletennis

#include <iostream>
#include <cmath>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#define M 1000000007
#define pii pair<int, int>
typedef long long ll;
using namespace std;
int main() {
    int n, k;
    cin >> n >> k;
    multiset<int>set1;
    vector<int>vec(n+k);
    ll sum = 0;
    for (int i = 0; i < n + k; i++) {
        cin >> vec[i];
        set1.insert(vec[i]);
        sum += vec[i];
    }
    for (int i = 0; i < n + k; i++) {
        ll sum1 = sum - vec[i];
        set1.erase(set1.find(vec[i]));
        auto it = set1.begin();
        int a1 = *it;
        ++it;
        int a2 = *it;
        int d = a2 - a1;
        ll sum2 = (2 * a1 + (n - 1) * d) * n / 2;
        if (sum2 == sum1) {
            int cnt = 0;
            for (int j = 0; j < n + k; j++) {
                if (j != i) {
                    cnt++;
                    cout << vec[j];
                    if (cnt != n)
                        cout << " ";
                }
            }
            break;
        }
        set1.insert(vec[i]);
    }
}

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