Submission #1455460

---

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;
  int a[T];
  FOR(i,0,T) cin >> a[i];
  sort(a, a + T);
  if(T == 1) {
    cout << a[0] - 1 << endl;
  } else {
    cout << max(0, a[T-1] - a[T-2] - 1) << endl;
  }
  return 0;
}

Submission Info

Judge Result