Submission #2389727

---

Source Code Expand

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>

#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

typedef long long LL;
typedef double db;

int get(){
	char ch;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	if (ch=='-'){
		int s=0;
		while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
		return -s;
	}
	int s=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
	return s;
}

int main(){
	int a=get(),b=get(),c=get(),x=get(),y=get();
	LL ans= 1e14;
	fo(d,0,max(x,y)){
		LL tmp=1ll*c*2*d+1ll*max(0,x-d)*a+1ll*max(0,y-d)*b;
		if (tmp<ans)ans=tmp;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result