1020. 月饼 (25)

最新推荐文章于 2020-11-02 17:46:32 发布

LoHiauFung

最新推荐文章于 2020-11-02 17:46:32 发布

阅读量597

点赞数

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/LoHiauFung/article/details/50548905

版权

PAT 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

PAT(乙) 1020. 月饼 (25)
来源：http://www.patest.cn/contests/pat-b-practise/1020

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int main() {
  int n = 0, need = 0, inthold = 0, i = 0, j = 0;
  double have[1010] = {0}, total_price[1010] = {0};
  double unitprice[1010] = {0};
  double floathold = 0, sum = 0;

  scanf("%d %d", &n, &need);
  for (i = 0; i < n; i++) scanf("%lf", &have[i]);
  for (i = 0; i < n; i++) scanf("%lf", &total_price[i]);
  for (i = 0; i < n; i++) unitprice[i] = ((double)(total_price[i]))/have[i];
  for (i = 0; i < n; i++)  {
    for (j = 0; j < n - 1; j++) {
      if (fabs(unitprice[j]) - fabs(unitprice[j+1]) < 0) {
        inthold = have[j];
        have[j] = have[j+1];
        have[j+1] = inthold;

        inthold = total_price[j];
        total_price[j] = total_price[j+1];
        total_price[j+1] = inthold;

        floathold = unitprice[j];
        unitprice[j] = unitprice[j+1];
        unitprice[j+1] = floathold;
      }
    }
  }
  i = 0;
  while (need > 0 && i < n) {
    if (need - fabs(have[i]) > 0) {
      sum += total_price[i];
      need -= have[i];
    } else {
      sum += (need * unitprice[i]);
      need = 0;
    }
    i++;
  }
  printf("%.2lf", sum);
  return 0;
}