二分单位体积的价值,然后判断是否可行。
题意:
给我们n个物品的体积和价值,从中选k件物品,求单位体积的最大价值是多少?
题解:
二分单位体积的价值,然后将原有的物品进行转换排序,选取前k件,判断是否可行。
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e4 + 10;
int n, k;
int allw, allp;
struct Node {
int w, p;
double pw;
}a[MAXN];
bool cmp(Node a, Node b) {
return a.pw > b.pw;
}
bool check(double mid) {
for (int i = 0; i < n; i++) {
a[i].pw = (double)a[i].p - a[i].w * mid; // 转化当前物品的价值
}
sort(a, a + n, cmp);
double sum = 0;
allw = 0, allp = 0;
for (int i = 0; i < k; i++) {
sum += a[i].pw;
allw += a[i].w;
allp += a[i].p;
}
if (sum >= 0) return true;
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i].w >> a[i].p;
}
double l = 0, r = 50000;
int sumw = 0, sump = 0;
while (r - l > 1e-6) { // 二分单位体积的价值
double mid = (l + r) / 2;
if (check(mid)) {
l = mid;
sumw = allw;
sump = allp;
}
else {
r = mid;
}
}
int g = __gcd(sumw, sump);
sumw /= g, sump /= g;
cout << sump << "/" << sumw << endl;
return 0;
}