状态:AC
是一个数学题,首先要明白尽量将单价贵的组成套装,其次要注意套装数量不能多余配件数量(也就是注意边界条件)
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <map>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <windows.h>
#include <deque>
#include <unordered_set>
#include <stack>
using namespace std;
int main() {
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
int x,y;
unsigned int out = 0;
if(f>e){
y = b>c?c:b;
y = y>d?d:y;
x = d - y;
x = x>a?a:x;
out = e*x + f*y;
}else{
x = a>d?d:a;
y = d - x;
y = y>b?b:y;
y = y>c?c:y;
out = e*x + f*y;
}
cout<<out<<endl;
//cout<<x<<" "<<y;
//-----
return 0;
}