Sicily.1093. Air Express

最新推荐文章于 2016-12-06 20:53:30 发布

豪运SYSU

最新推荐文章于 2016-12-06 20:53:30 发布

阅读量310

点赞数

分类专栏： Sicily

本文链接：https://blog.csdn.net/xiehaoyun2012/article/details/8444342

版权

Sicily 专栏收录该内容

99 篇文章 1 订阅

订阅专栏

#include <stdlib.h>
#include <iostream>
#include <stdlib.h>
#include<algorithm>
using namespace std;
int w1,r1,w2,r2,w3,r3,r4; 

int getMinPrice(int w, int &delta){

   if(w > w3){
     delta = 0;
     return w * r4;
   } 
   
   if(w > w2 && w <= w3){
      int minPrice = w*r3;
      if(minPrice > (w3+1)*r4){
         delta = w3 +1 - w;
         minPrice = (w3+1)*r4;     
      }  
      return  minPrice; 
   }
   
   if( w>w1 && w <= w2){
     int minPrice = w*r2;
     
     if( minPrice > (w3+1)*r4  ){
        minPrice = (w3+1)*r4;
        delta = w3+1 -w;     
     }
     
     if(minPrice > (w2+1)*r3){
       minPrice = (w2+1)*r3;
       delta = w2+1 -w;      
     }
     return minPrice;  
   }
   
    if( w <=w1 ){
     int minPrice = w*r1;
     
     if( minPrice > (w3+1)*r4  ){
        minPrice = (w3+1)*r4;
        delta = w3+1 -w;     
     }
     
     if(minPrice > (w2+1)*r3){
       minPrice = (w2+1)*r3;
       delta = w2+1 -w;      
     }
     
     if(minPrice  > (w1+1)*r2){
       minPrice = (w1+1)*r2;
       delta = w1+1 -w;      
     }
     return minPrice;  
   }
   
     
}
int main()
{
    int d[4][2];
    int num = 1;
  
    int n;
    while(!cin.eof()){
        cin >> w1 >> r1 >> w2 >> r2 >> w3 >> r3>> r4;
        cout << "Set number " << num << ":" << endl; 
        while(cin >> n && n!=0){
            int delta = 0;
            int minP =getMinPrice(n, delta);  
            cout << "Weight ("<< n << ") has best price $"<< minP << " (add " << delta << " pounds)" << endl;
                  
        }
        cout << endl;
        num++;
                       
    }	
    system("pause");
    return 0;
}