Submission #1317456

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int DIM = 1e5 + 5;

int arr[DIM];

int main( void ) {
    
    int k, t;
    cin >> k >> t;
    
    for( int i = 1; i <= t; i ++ )
        cin >> arr[i];
    
    sort( arr + 1, arr + t + 1 );
    cout << max( 0, arr[t] - (k - arr[t] + 1) ) << endl;
    
    return 0;
}

Submission Info

Judge Result