A. Road To Zero

problem description

You are given two integers x and y. You can perform two types of operations:
Pay a dollars and increase or decrease any of these integers by 1. For example, if x=0 and y=7 there are four possible outcomes after this operation: x=0, y=6;x=0, y=8;x=−1, y=7;x=1, y=7 .
Pay b dollars and increase or decrease both integers by 1. For example, if x=0 and y=7 there are two possible outcomes after this operation: x=−1,y=6;x=1, y=8 .
Your goal is to make both given integers equal zero simultaneously, i.e. x=y=0. There are no other requirements. In particular, it is possible to move from x=1, y=0 to x=y=0.
Calculate the minimum amount of dollars you have to spend on it.

input

The first line contains one integer t (1≤t≤100
) — the number of testcases.
The first line of each test case contains two integers x
and y (0≤x,y≤109).
The second line of each test case contains two integers a
and b (1≤a,b≤109).

utput

For each test case print one integer — the minimum amount of dollars you have to spend.

example

Input
2
1 3
391 555
0 0
9 4
Output
1337
0

Note

In the first test case you can perform the following sequence of operations: first, second, first. This way you spend 391+555+391=1337
dollars.
In the second test case both integers are equal to zero initially, so you dont’ have to spend money.

注意数据类型用longlong。

#include 
#include 
#include 
#include 
#include 
typedef long long ll;
using namespace std;
int main()
{
    ll t,s1=0,s2=0;
    ll a,b,x,y;
    cin>>t;
    while(t--)
    {
        cin>>x>>y;
        cin>>a>>b;
        s1=min(x,y)*b+(max(x,y)-min(x,y))*a;
        s2=x*a+y*a;
        cout<<min(s1,s2)<<endl;
    }
    return 0;
}