Submission #3416636

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;

int main(int argc, char const* argv[])
{
  int n;
  cin >> n;
  vector<ll> vec;
  ll maxi = 0;
  ll sum = 0;
  for(int i = 0; i < n; i++){
    ll d;
    cin >> d;
    vec.pb(d);
    sum += d;
    maxi = max(maxi, d);
  }
  cout << sum << endl;
  if(maxi <= sum - maxi)cout << 0 << endl;
  else cout << 2 * maxi - sum << endl;
	return 0;
}

Submission Info

Judge Result