Submission #5990931

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1000003 ;

int main(){
  int k,t;
  cin >> k >> t;
  int a[t];
  rep(i,t)cin >> a[i];
  sort(a,a+t,greater<int>());
  int sum=0;
  rep(i,t)sum+=a[i];
  cout << max(0,2*a[0]-1-sum) << endl;
return 0;}

Submission Info

Judge Result