์•Œ๊ณ ๋ฆฌ์ฆ˜

  1. ์ •๋ ฌ ํ›„ ์•ž์—์„œ๋ถ€ํ„ฐ ๊ฒ€์‚ฌ
  2. (์ด์ „๊นŒ์ง€ ์—ฐ์†์ ์œผ๋กœ ์žด ์ˆ˜ ์žˆ๋Š” ๋ฌด๊ฒŒ์˜ ์ตœ๋Œ“๊ฐ’ + 1) ๋ณด๋‹ค ํ˜„์žฌ ์ถ”๊ฐ€ ๋” ๋ฌด๊ฑฐ์šฐ๋ฉด break. ์ตœ๋Œ“๊ฐ’ + 1์ด ์žด์ˆ˜์—†๋Š” ์ตœ์†Œ์˜ ๊ฐ’์ž„.

์ฝ”๋“œ

#include <bits/stdc++.h>
 
using namespace std;
 
int n, weights[1010];
 
int main() {
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> weights[i];
	sort(&weights[0], &weights[n]);
 
	int result = 0;
	for (int i = 0; i < n; i++) {
		if (weights[i] > result + 1)
			break;
		result += weights[i];
	}
 
	cout << result + 1;
}