{"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 possible sum of the numbers written on the cards chosen?\n\n## Constraints\n\n*   All values in input are integers.\n*   $0 \\leq A, B, C$\n*   $1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$ $C$ $K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc167_b","tags":[],"sample_group":[["2 1 1 3","2\n\nConsider 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."],["1 2 3 4","0"],["2000000000 0 0 2000000000","2000000000"]],"created_at":"2026-03-03 11:01:14"}}