【PAT甲级】1070. Mooncake (25)

lambsnow

于 2017-06-21 17:25:13 发布

阅读量253

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.csdn.net/lambsnow/article/details/73551200

PAT 专栏收录该内容

78 篇文章

订阅专栏

#include <stdio.h>
#include <algorithm>
using namespace std;
typedef struct Cake {
    double ton;
    double price;
    double up;
} Cake;
bool cmp(Cake a, Cake b) {
    return a.up > b.up;
}

int main(int argc, char *argv[]) {
    int n;
    double t;
    scanf("%d %lf", &n, &t);
    Cake *c = new Cake[n];
    for (int i = 0; i < n; i++) {
        scanf("%lf", &c[i].ton);
    }
    for (int i = 0; i < n; i++) {
        scanf("%lf", &c[i].price);
        c[i].up = c[i].price / c[i].ton;
    }
    sort(c, c + n, cmp);
    int i = 0;
    double p = 0.0;
    while (t > 0 && i < n) {
        if (c[i].ton > t) {
            p += t * c[i].up;
            break;
        } else {
            p += c[i].price;
            t -= c[i].ton;
            i++;
        }
    }
    printf("%.2lf\n", p);

    return 0;
}