题目链接: https://ac.nowcoder.com/acm/contest/12606/F
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
ll a[100005];
ll n;
ll sum = 0;
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
sort(a,a+n);
sum /= 2;
ll _sum = 0;
ll f1 = 0;
for(int i = 0; i < n; ++i) {
_sum += a[i];
if(_sum == sum) {
if(a[i+1] == a[i]) {
cout << a[i] << endl;
return 0;
}
else if(a[i+1] != a[i]) {
cout << a[i]+1 << endl;
return 0;
}
}
else if(_sum > sum) {
cout << a[i] << endl;
return 0;
}
}
}