2437 저울

#include <stdio.h>
 
int arr[10000000] = { 0 };
 
void qSort(int start, int end) {
    int l = start + 1, r = end;
    int num = arr[start];
 
    do {
        while (arr[l] <= num && l < end) l++;
        while (num <= arr[r] && start < r) r--;
 
        if (l < r) {
            int temp = arr[l];
            arr[l] = arr[r];
            arr[r] = temp;
        }
    } while (l < r);
 
    int temp = arr[r];
    arr[r] = arr[start];
    arr[start] = temp;
 
    if (start < r - 1) {qSort(start, r - 1); }
    if (r + 1 < end) { qSort(r + 1, end);  }
}
 
int main() {
    int n;
    scanf("%d", &n);
 
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
 
    qSort(0,n-1);
 
    int prevB=0, curB=0;
    for (int i = 0; i < n; i++) {
        if (i == 0) {
            if (arr[i] != 1) {
                printf("1");
                return 0;
            }
            else {
                prevB = 1;
            }
        }
        else {
            curB = prevB + arr[i];
 
            if (prevB + 1 < arr[i]) {
                printf("%d", prevB + 1);
                return 0;
            }
            else {
                prevB = curB;
            }
            if (i == n - 1) {
                printf("%d", prevB+1);
                return 0;
            }
        }
    }
}