Submission #3880530

---

Source Code Expand

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0);
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
	fill((T *)array, (T *)(array + N), val);
}

const ll INF = 1e16;
const ll MOD = 1e9 + 7;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//ll pas[5001][5002];

void ans(int y, int m, int d){
	string m1 = to_string(m), d1 = to_string(d);
	if(m1.size() == 1)m1 = '0' + m1;
	if(d1.size() == 1)d1 = '0' + d1;
	cout << y << '/' << m1 << '/'<< d1 << endl;
}

signed main(){
	IOS
	ll n;
	cin >> n;
	ll sum = 0;
	ll M = 0;
	for (int i = 0;i < n;++i) {
		ll x;
		cin >> x;
		sum += x;
		M = max(M, x);
	}
	cout << sum << endl;
	cout << max(M - (sum - M),(ll)0) << endl;
}

Submission Info

Judge Result