Submission #1331369

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

inline char get(void) {
	static char buf[100000], *S = buf, *T = buf;
	if (S == T) {
		T = (S = buf) + fread(buf, 1, 100000, stdin);
		if (S == T) return EOF;
	}
	return *S++;
}
inline void read(int &x) {
	static char c; x = 0; int sgn = 0;
	for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1;
	for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
	if (sgn) x = -x;
}
inline int read(char *s) {
	static char c; int len = 0;
	for (c = get(); c < 'a' || c > 'z'; c = get());
	for (; c >= 'a' && c <= 'z'; c = get()) s[len++] = c;
	s[len] = 0; return len;
}

int k, n, x, y, ans;
int a[10101];

int main(void) {
	read(k); read(n);
	for (int i = 1; i <= n; i++) read(a[i]);
	x = *max_element(a + 1, a + n + 1);
	y = k - x;
	if (x <= y + 1) ans = 0;
	else ans = x - y - 1;
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result