单位价值的最大值

Yougth的最大化
时间限制：1000 ms | 内存限制：65535 KB
难度：4
描述
Yougth现在有n个物品的重量和价值分别是Wi和Vi，你能帮他从中选出k个物品使得单位重量的价值最大吗？

输入
有多组测试数据
每组测试数据第一行有两个数n和k，接下来一行有n个数Wi和Vi。
(1<=k=n<=10000) (1<=Wi,Vi<=1000000)
输出
输出使得单位价值的最大值。（保留两位小数）
样例输入
3 2
2 2
5 3
2 1
样例输出
0.75

// 枚举
// 复杂度 n^k;

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

float get_max(vector<vector<float> >& v, vector<int> ids) {
    float mg = 0;
    float val = 0;
    for (auto& id : ids) {
        mg += v[id][0];
        val += v[id][1];
    }
    return val / mg;
}

void reSolver(int begNum, int num, vector<int>& ans, 
        vector<vector<float> >& v, float& ret) {

    if (num == 0) {
        ret = max(get_max(v, ans), ret);
        return;
    }

    for (int i = begNum; i + num - 1 < v.size(); ++i) {
        ans.push_back(i);
        reSolver(i + 1, num - 1, ans, v, ret);
        ans.pop_back();
    }

}

int main() {
    int n = 0;
    int k = 0;
    cin >> n >> k;
    vector<vector<float> > v(n, vector<float>(2, 0));
    for (int i = 0; i < n; ++i) {
        float mg = 0;
        float val = 0;
        cin >> mg >> val;
        v[i] = vector<float>{mg, val};
    }

    float ret = 0;
    vector<int> ans;
    reSolver(0, k, ans, v, ret);
    cout << ret;
    return 0;
}

未证实

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

float get_max(vector<vector<float> >& v, vector<int> ids) {
    float mg = 0;
    float val = 0;
    for (auto& id : ids) {
        mg += v[id][0];
        val += v[id][1];
    }
    return val / mg;
}

bool cmp(tuple<int, float> a, tuple<int, float> b) {
    return get<1>(a) > get<1>(b);
}
void reSolver(int k, vector<vector<float> >& v, float& ret) {

    vector<tuple<int, float> > tmp;
    for (int i = 0; i < v.size(); ++i) {
        tmp.push_back(make_tuple(i, v[i][1] - v[i][0] * ret));
    }


    sort(tmp.begin(), tmp.end(), cmp);

    float last = ret;
    float mg = 0;
    float val = 0;
    for (int i = 0; i < k; ++i) {
        int id = get<0>(tmp[i]);
        mg += v[i][0];
        val += v[i][1];
    }
    ret = val / mg;
    cout << ret << endl;
    if (ret - last < 0.000001) return;
    reSolver(k, v, ret);

}

int main() {
    int n = 0;
    int k = 0;
    cin >> n >> k;
    vector<vector<float> > v(n, vector<float>(2, 0));
    for (int i = 0; i < n; ++i) {
        float mg = 0;
        float val = 0;
        cin >> mg >> val;
        v[i] = vector<float>{ mg, val };
    }

    float mg = 0;
    float val = 0;
    for (int i = 0; i < k; ++i) {
        mg += v[i][0];
        val += v[i][1];
    }
    float ret = val / mg;
    cout << ret << endl;
    reSolver(k, v, ret);
    cout << ret;
    return 0;
}