知识点:二分
这是一个最大化的二分,题目说的是保留小数点后两位,但是这个写法是两位后面的直接舍去了,但是也只能这么写,直接用.f过不了,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int N = 1e4 + 5;
int n, k;
double a[N];
bool check(double x) {
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt += (int)floor(a[i] / x);
}
return cnt >= k;
}
void solve(double l, double r) {
for (int i = 0; i < 100; i++) {
double mid = (l + r) / 2;
if (check(mid)) l = mid;
else r = mid;
}
printf("%.2f", floor(l * 100) / 100);
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
solve(0, 1000000000);
return 0;
}