Submission #24799

---

Source Code Expand

#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <bitset>
#include <fstream>
#include <sstream>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <iostream>
#include <algorithm>
//#include <sys/time.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));++i)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bit(n) (1ll<<(li)(n))
#define all(vec) (vec).begin(),(vec).end()
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define MP make_pair
#define F first
#define S second


int main()
{
	int n;
	cin >> n;
	vector<int> d(n);

	int max=0, min=0;
	for(int i = 0; i < n; i++) {
		cin >> d[i];
		max += d[i];
	}

	sort(d.begin(), d.end());
	min = d[0];
	if (n < 2)
	{
		if (n == 1) { min = d[0]; }
	} else if((d[n-1] < (max-d[n-1]))){
		min = 0;
	} else {
		min = d[n-1]-max+d[n-1];
	}

	printf("%d\n", max);
	printf("%d\n", min);
}

Submission Info

Judge Result