Codeforces 1342A - Road To Zero Solution

 Solution in C++:

 ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

1. #include <bits/stdc++.h>
2. using namespace std;
3. int main()
4. {
5. long long int a,b,mn,d,x,y,t,m,n;
6. cin>>t;
7. while(t--)
8. {
9. cin>>x>>y>>a>>b;
10. m= min(x,y)*b+abs(x-y)*a;
11. n=(x+y)*a;
12. cout<<min(m,n)<<endl;
13. }
14. }