Submission #1040917

---

Source Code Expand

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

#define REP(i, s, n) for(int i = s; i < n; ++i)
#define rep(i, n)		 REP(i, 0, n)
#define SORT(c)			 sort((c).begin(), (c).end())
#define IINF	INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false

typedef long long				ll;
typedef pair <int, int> ii;

int main() {
	int n;
	cin >> n;
	vector<ll> d(n);
	
	ll maxi  =0;
	ll sum = 0;
	rep(i, n) {
		cin >> d[i];
		sum += d[i];
		maxi = max(maxi, d[i]);
	}
	
	cout << sum <<endl;
	if(n == 1)cout << sum <<endl;
	else if(n == 2) cout << abs(d[0] - d[1]) << endl;
	else if(n == 3){
		if(d[0] + d[1] > d[2] && d[2] > abs(d[0] - d[1])) cout << 0 <<endl;
		else cout << maxi + maxi - sum << endl;
		
	}
	else {
		if(sum < 2 * maxi) cout << maxi + maxi - sum <<endl;
		else cout << 0 <<endl;
	}
	
	return 0;
}

Submission Info

Judge Result