包堆德

#include<iostream>
using namespace std;
int main()
{
long long counto,countx,maxo,maxx;
while (cin>>counto>>countx>>maxo>>maxx)
{
maxo=min(counto,maxo);
maxx=min(countx,maxx);
if (maxo0) cout<<maxx<<endl;
else if (maxx0) cout<<maxo<<endl;
else if ((counto+1)*maxx<countx) cout<<(counto+1)*maxx+counto<<endl;
else if ((countx+1)*maxo<counto) cout<<(countx+1)*maxo+countx<<endl;
else cout<<counto+countx<<endl;
}
return 0;
}