Greedy Takahashi

AtCoder

IDabc149_b

Time2000ms

Memory256MB

Difficulty—

Takahashi has $A$ cookies, and Aoki has $B$ cookies. Takahashi will do the following action $K$ times: * If Takahashi has one or more cookies, eat one of his cookies. * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies. * If they both have no cookies, do nothing. In the end, how many cookies will Takahashi and Aoki have, respectively? ## Constraints * $0 \leq A \leq 10^{12}$ * $0 \leq B \leq 10^{12}$ * $0 \leq K \leq 10^{12}$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $A$ $B$ $K$ [samples]

Samples

Input #1

2 3 3

Output #1

0 2

Takahashi will do the following:

*   He has two cookies, so he eats one of them.
*   Now he has one cookie left, and he eats it.
*   Now he has no cookies left, but Aoki has three, so Takahashi eats one of them.

Thus, in the end, Takahashi will have $0$ cookies, and Aoki will have $2$.

Input #2

500000000000 500000000000 1000000000000

Output #2

0 0

Watch out for overflows.

API Response (JSON)

{
  "problem": {
    "name": "Greedy Takahashi",
    "description": {
      "content": "Takahashi has $A$ cookies, and Aoki has $B$ cookies. Takahashi will do the following action $K$ times: *   If Takahashi has one or more cookies, eat one of his cookies. *   Otherwise, if Aoki has one",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc149_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi has $A$ cookies, and Aoki has $B$ cookies. Takahashi will do the following action $K$ times:\n\n*   If Takahashi has one or more cookies, eat one of his cookies.\n*   Otherwise, if Aoki has one...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments