Submission #22970

---

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>
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()
{
	li n;
	cin >> n;
	vector<pair<double, double> > a(n);
	rep(i, n) cin >> a[i].F >> a[i].S;
	double res = 0;
	rep(i, n)rep(j, i) res = max(res, hypot(a[i].F - a[j].F, a[i].S - a[j].S));
	printf("%0.30lf\n", res);
}*/

int main()
{
	li n;
	cin >> n;
	vector<double> d(n);
	rep(i, n) cin >> d[i];
	double maxi = 0;
	double sum = 0;
	rep(i, n) sum += d[i];
	rep(i, n) maxi = max(maxi, d[i] - (sum - d[i]));
	printf("%0.30lf\n", sum);
	printf("%0.30lf\n", maxi);
}

Submission Info

Judge Result