1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

#include <iostream>
#include <vector>
#include <algorithm>

class Solution {
public:
    int maximumTastiness(std::vector<int>& price, int k) {
        int n = price.size();
        std::sort(price.begin(), price.end());
        int left = 0, right = (price.back() - price[0]) / (k - 1);
        
        while (right >= left) {
            int mid = (left + right) / 2;
            if (check(price, k, mid, n)) {
                left = mid + 1;
            }
            else {
                right = mid - 1;
            }
        }
        
        return right;
    }
    
private:
    bool check(std::vector<int>& price, int k, int min_diff, int n) {
        if (!min_diff) {
            return n >= k;
        }
        
        int prev = price[0], i = 0;
        while (--k) {
            i = std::lower_bound(price.begin() + i, price.end(), prev + min_diff) - price.begin();
            if (i >= n) {
                return false;
            }
            prev = price[i];
        }
        return true;
    }
};