For this Question: Newton has A cookies, and Einstein has B cookies. Newton will do the following action K times:
1) If Newton has one or more cookies, eat one of his cookies.
2) Otherwise, if Einstein has one or more cookies, eat one of Einstein's cookies.
3) If they both have no cookies, do nothing.

In the end, how many cookies will Newton and Einstein have, respectively?The first line of the input contains 3 integers, A, B and K

<b>Constraints:</b>
1) 0 &le; A &le; 10<sup>12</sup>
2) 0 &le; B &le; 10<sup>12</sup>
3) 0 &le; K &le; 10<sup>12</sup>Print the number of Newton's and Einstein's cookies after K actions.<b>Sample Input 1:</b>
2 3 3

<b>Sample Output 1:</b>
0 2

<b>Sample Explanation 1:</b>
Newton will do the following:

1) He has two cookies, so he eats one of them.
2) Now he has one cookie left, and he eats it.
3) Now he has no cookies left, but Einstein has three, so Newton eats one of them.

Thus, in the end, Newton will have 0 cookies, and Einstein will have 2.
, I have written this Solution Code: #include<iostream>
using namespace std;

int main(){
  int64_t A, B, K; cin >> A >> B >>K;
  B = A <= K ? max(B-(K-A), (int64_t)0) : B;
  A = max(A-K, (int64_t)0);
  cout << A << ' ' << B << endl;
  return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?