Submission #23771

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  int N;
  vector<int> v;
  
  cin >> N;
  int maxv = 0, maxd = 0;
  rep(i,N){
    int d;
    cin >> d;
    v.push_back(d);
    maxv += d;
    maxd = max(maxd, d);
  }
  
  cout << maxv << endl;
  
  if(N == 1){
    cout << v[0] << endl;
  }
  else if(N == 2){
    cout << abs(v[0]-v[1]) << endl;
  }
  else {
    if(maxd - (maxv - maxd) > 0 ){
      cout << maxd - (maxv - maxd) << endl;
    }else{
      cout << 0 << endl;
    }
  }
  return 0;
}

Submission Info

Judge Result