[2792] 보석상자

아주 전형적인 이분탐색으로 정답찾기 쉬워유

 

* functional.h 사용 X

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX 300000
int n, m, res = 1000000000;
int jewerly[MAX];
 
int max(int first, int second) {
    if (first > second) return first;
    else return second;
}
int min(int first, int second) {
    if (first > second) return second;
    else return first;
}
bool solve(int mid) {
    int person = 0;
    for (int i = 0; i < m; i++) {
        person += jewerly[i] / mid;
        if (jewerly[i] % mid) {
            person += 1;
        }
    }
    if (person > n) return false;
    else return true;
}
int main() {    
    int i = 0, r;
    scanf("%d %d", &n, &m);
    int left = 0, right = 0;
 
    for (int i = 0; i < m; i++) {
        scanf("%d", &jewerly[i]);
        right = max(right, jewerly[i]);
    }
    while (left <= right) {
        int mid = (left + right) / 2;
        if (solve(mid)) {
            res = min(res, mid);
            right = mid - 1;
        }
        else {
            left = mid + 1;
        }
    }
    printf("%d\n", res);
}