백준 2437 저울

단순 정렬 문제.

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int N;

vector<int> arr;
void input(){
  cin >> N;  
  arr.resize(N);
  for(int i = 0; i < N ; i++){
    cin >> arr[i];
  }
  
}

void solve(){
  sort(arr.begin(), arr.end());
  int ret = 1;
  for(int i = 0; i < N; i++){
    if(arr[i] > ret) break;
    ret += arr[i];
  }
  cout << ret;
}

int main() {
  input();
  solve();
  return 0;
}