Easy Linear Programming

AtCoder

IDabc167_b

Time2000ms

Memory256MB

Difficulty—

We have $A$ cards, each of which has an integer $1$ written on it. Similarly, we also have $B$ cards with $0$s and $C$ cards with $-1$s. 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$ [samples]

Samples

Input #1

2 1 1 3

Output #1

2

Consider picking up two cards with $1$s 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.

Input #2

1 2 3 4

Output #2

Input #3

2000000000 0 0 2000000000

Output #3

2000000000

API Response (JSON)

{
  "problem": {
    "name": "Easy Linear Programming",
    "description": {
      "content": "We have $A$ cards, each of which has an integer $1$ written on it. Similarly, we also have $B$ cards with $0$s and $C$ cards with $-1$s. We will pick up $K$ among these cards. What is the maximum poss",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc167_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have $A$ cards, each of which has an integer $1$ written on it. Similarly, we also have $B$ cards with $0$s and $C$ cards with $-1$s.\nWe will pick up $K$ among these cards. What is the maximum poss...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments