Submission #1954476

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#define MOD 1000000007LL
using namespace std;

int main(){
	int k, t;
	cin >> k >> t;
	int a[t];
	for(int i = 0; i < t; i++){
		cin >> a[i];
	}
	sort(a, a+t);
	int ans = 0;
	int first = 0, last = t-1;
	for(int i = 0; i < k; i++){
		if(first == last) ans = a[first] - 1;
		else{
			if(a[first] != 0 && a[last] != 0){
				a[first]--;
				a[last]--;
				i++;
			}
			else{
				if(a[first] == 0){
					first++;
				}
				if(a[last] == 0){
					last--;
				}
				if(first == last) ans = a[first] - 1;
				else{
					a[first]--;
					a[last]--;
					i++;
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result