提出 #945459

---

ソースコード 拡げる

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#include <queue>

#define ALL(v) (v).begin(),(v).end()
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{␣"; for(auto nth : list){ cout << nth << "␣"; } cout << "}" << endl;

using namespace std;

const int INF = INT_MAX / 3;

int main() {
    int K, T;
    cin >> K >> T;
    vector<int> cakes(T, 0);
    priority_queue<int> que;
    bool flag = false;
    map<int, int> cnt;
    for (int nth = 0; nth < T; ++nth) {
        cin >> cakes[nth];
        cnt[cakes[nth]] += 1;
        if (cnt[cakes[nth]] == T) flag = true;
        que.push(cakes[nth]);
    }

    //sort(ALL(cakes), greater<int>());

    while (que.size() != 1) {
        int c1 = que.top(); que.pop();
        int c2 = que.top(); que.pop();
        int diff = c1 - c2;
        que.push(diff);
    }
    cout << ((flag && T != 1)? 0 : que.top() - 1) << endl;
    return 0;
}

提出情報

ジャッジ結果