[백준] 실버2 : (2512) 예산

https://www.acmicpc.net/problem/2512

2512번: 예산

 

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

int N, Num;
vector<int> v;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> N;

    for (int i = 0, j; i < N; ++i)
    {
        cin >> j;
        v.push_back(j);
    }
    cin >> Num;

    sort(v.begin(), v.end());

    int left = 1, right = v[v.size() - 1];

    while (left <= right)
    {
        int mid = (left + right) / 2, temp = 0;

        for (const auto& i : v)
        {
            if (i - mid > 0) temp += mid;
            else temp += i;
        }

        if (Num < temp) right = mid - 1;
        else if (Num >= temp) left = mid + 1;
    }

    cout << right << "\n";
}