BOJ 2512: 예산

#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
int inp[10100];
int sum, s, e, mid;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> inp[i];
	}
	sort(inp, inp+n+1);
	cin >> m;
	e = inp[n];
	
	while(s<=e){
		mid = (s+e)/2;
		sum = 0;
		
		for(int i=1; i<=n; i++){
			if(inp[i]<=mid) sum += inp[i];
			else sum += mid;
		}
		if(sum <= m){
			s = mid+1;
		}
		else{
			e=mid-1;
		}
	}
	cout << e;
	
	return 0;
}