P2240 【深基12.例1】部分背包问题

#include <bits/stdc++.h>
using namespace std;


class coin {
public:
    int m;
    int v;
    float price;

    coin(int a, int b) : m(a), v(b), price((float)b / a) {}
    coin() : m(0), v(0), price(0.0f) {}
};

int main() {
    coin bag[100];
    int n,t, m, v;
    cin >> n>>t;
    for (int i = 0; i < n; i++) {
        cin >> m >> v;
        bag[i] = coin(m, v);
    }

    for (int i = 0; i < n; i++) {
        for (int q = 0; q < n - 1 - i; q++) {
            if (bag[q].price < bag[q + 1].price) {
                swap(bag[q], bag[q + 1]);
            }
        }
    }

    float sum = 0;
    float mm = 0;
    for (int i = 0; ; i++) {
        if (mm + bag[i].m <= t) {
            sum += bag[i].v;
            mm += bag[i].m;
        }
        else {
            sum += (t - mm) * bag[i].price;
            break;
        }
    }
    cout << fixed << setprecision(2) << sum;
    return 0;
}