Submission #944295

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
typedef long long ll;
using namespace std;

int K, T;
int a[105];
int temp[105];

signed main()
{
	cin >> K >> T;
	rep(i,T) {
		cin >> a[i];
	}
	sort(a, a + T, greater<int>());

	//rep(i,T) cout << a[i] << " ";

	int hairetu_kosu = T;

	while (hairetu_kosu > 1) {
		int ind = 0;
		rep(i,hairetu_kosu) {
			if (i + 1 >= hairetu_kosu) {
				if (a[i] > 0) {
					a[ind++] = a[i];
				}
				i++;
			} else {
				if (a[i] - a[i+1] > 0) {
					a[ind++] = a[i] - a[i+1];
				}
				i++;
			}
		}
		hairetu_kosu = ind;
		sort(a, a + hairetu_kosu, greater<int>());
	}
	cout << a[0] - 1 << endl;
}

Submission Info

Judge Result