Problem:
Score : 200 points

Problem Statement

We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.

We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?

Constraints

All values in input are integers.

0 \leq A, B, C

1 \leq K \leq A + B + C \leq 2 \times 10^9

Input

Input is given from Standard Input in the following format:

A B C K

Output

Print the maximum possible sum of the numbers written on the cards chosen.

Sample Input 1

2 1 1 3

Sample Output 1

2

Consider picking up two cards with 1s and one card with a 0.
In this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.

Sample Input 2

1 2 3 4

Sample Output 2

0

Sample Input 3

2000000000 0 0 2000000000

Sample Output 3

2000000000

Solution in JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)


// inputに入力データ全体が入る
function Main(input) {
  // 1行目がinput[0], 2行目がinput[1], …に入る
  let [a, b, _, k] = input.split("\n")[0].split(' ').map(value => Number(value));
  if (k <= a) {
    console.log(k);
    return;
  } else {
    k = k - a;
  }
  if (k <= b) {
    console.log(a);
    return;
  } else {
    k = k - b;
  }
  console.log(a - k);
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(`2 1 1 3`);
// Main(require("fs").readFileSync("/dev/stdin", "utf8"));