HDU - 1009 FatMouse' Trade 贪心

为了得到更多的那个东西，需要 J [ i ] / F [ i ] 的值尽量大

定义结构体排序就好了，，

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

typedef long long ll;
const int maxn = 100000, INF = 0x3f3f3f3f;

int n, m;

struct node {
    double v, w;
    double ans;
}a[maxn];
bool cmp(node a, node b) {
    return a.ans > b.ans;
}


int main() {

    while(~scanf("%d %d", &n, &m)) {
        if(n == -1 && m == -1) break;

        for(int i = 0; i < m; ++i) {
            //cin >> a[i].v >> a[i].w;
            scanf("%lf%lf", &a[i].v, &a[i].w);
            a[i].ans = a[i].v / a[i].w;
        }
        sort(a, a+m, cmp);

        double ans = 0;
        for(int i = 0; i < m; ++i) {
            if(n <= 0) break;

            //ans += (a[i].ans * min(n, (int)a[i].w) );
            if(n >= a[i].w) {
                ans += a[i].v;
            } else ans += (a[i].ans * n);

            n -= a[i].w;

        }

        //cout << ans << endl;
        printf("%.3lf\n", ans);
    }


    return 0;
}