Submission #4131039

---

Source Code Expand

#include<iostream>
using namespace std;

const int MAX_N = 505;

int d[MAX_N];

int main() {
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> d[i];
    }
    if (N == 1) {
        cout << d[0] << endl;
        cout << d[0] << endl;
    }
    else {
        int sum_d = 0;
        for (int i = 0; i < N; i++) {
            sum_d += d[i];
        }
        cout << sum_d << endl;
        for (int i = 0; i < N; i++) {
            if (d[i] * 2 > sum_d) {
                sum_d = d[i];
                for (int j = 0; j < N; j++) {
                    if (i == j) continue;
                    sum_d -= d[j];
                }
                cout << sum_d << endl;
                return 0;
            }
        }
        cout << 0 << endl;
    }
    return 0;
}

Submission Info

Judge Result