Submission #1164044

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int>P;


int main() {
	int K, T;
	cin >> K >> T;

	int a[110];
	for (int i = 0; i < T; i++)
		cin >> a[i];

	sort(a, a + T);
	reverse(a,a + T);

	int j = 1;
	int type = -1;
	int ans = 0;
	int flag = 0;
	if (T == 1) {
		cout << K - 1 << endl;
	}
	else {
		for (int i = 0; i < K; i++) {
			if ((i % 2 == 0 && a[0] != 0) || flag) {
				a[0]--;
			}
			else {
				while (a[j] == 0 && !flag) {
					j++;
					if (j == T) ans = a[0];
				}
				a[j]--;
				j++;
				if (j > T-1)j = 1;
			}
		}
		cout << ans << endl;
	}
	return 0;
}

Submission Info

Judge Result