Submission #1455476

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main()
{
  int K, T;
  cin >> K >> T;
  priority_queue<int> que;
  FOR(i,0,T) {
    int in;
    cin >> in;
    que.push(in);
  }
  while(!que.empty()) {
    int a = que.top();que.pop();
    if(que.empty()) {
      cout << a - 1 << endl;
      return 0;
    }
    int b = que.top();que.pop();
    if(a-1>0) que.push(a-1);
    if(b-1>0) que.push(b-1);
  }
  cout << 0 << endl;
  return 0;
}

Submission Info

Judge Result