天天看點

[PAT][Basic Level]1020 code review

AC CODE:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
struct mooncake{
    double store;
    double total;
    double price;
};
bool cmp(struct mooncake a,struct mooncake b){
    return a.price > b.price ;
}
int main()
{
    int n,D;
    cin>>n>>D;
    double ans = 0;
    struct mooncake *mooncake;
    mooncake = (struct mooncake *)malloc(sizeof(struct mooncake)*n);
    
    for(int i = 0; i < n ; i ++){
        cin>>mooncake[i].store;
    }
    for(int i = 0 ;i < n ; i ++){
        cin>>mooncake[i].total;
        mooncake[i].price = (mooncake[i].total / mooncake[i].store) ;
    }
    
    sort(mooncake,mooncake+n,cmp);
    
    for( int i = 0 ; i < n ; i ++){
        if( mooncake[i].store > D){
            ans += D * mooncake[i].price ;
            break;
        }
        else{
            ans += mooncake[i].total;
            D -= mooncake[i].store ;
        }
    }
    
    
    cout<<setiosflags(ios::fixed)<<setprecision(2)<<ans<<endl;
    // for(int i = 0;i < n ; i ++){
    //    cout<<setiosflags(ios::fixed)<<setprecision(2)<<mooncake[i].price<<endl;
    //}
    
    return 0;
}