cf Educational Codeforces Round 86 A题

点击链接跳转

A. Road To Zero

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given two integers x and y. You can perform two types of operations:

1.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.

2.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).

Output
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.

大致题意：有俩个数字x,y可以进行以下俩种操作：
第一种操作：选择其中一个数字，+1或者-1
第二种操作：俩个数字同时+1或者同时-1
其中第一种操作的代价是 a,第二种操作的代价是b，求最少代价使得，经过操作之后，x,y都变成0
思路：看了操作可以知道，第二种操作实际上进行了俩次第一种操作，因此，当b < 2 * a时，选择第二种操作，反之，选择第一种操作
上代码：

#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        ll x, y, a, b;
        scanf("%I64d%I64d", &x, &y);
        scanf("%I64d%I64d", &a, &b);
        if(2 * a > b)
        {/*相同部分选择第2种操作*/
            printf("%I64d\n", b * min(x, y) + a *( x + y - 2 * min(x, y)));
        }
        else
        {
            printf("%I64d\n", a *( x + y));
        }

    }
    return 0;
}