Problem:


Score : 200 points

Problem Statement

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

Output

Print the numbers of Takahashi's and Aoki's cookies after K actions.

Sample Input 1

2 3 3

Sample 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.

Sample Input 2

500000000000 500000000000 1000000000000

Sample Output 2

0 0

Watch out for overflows.



Sample input:
2 3 3


Sample output:
0 2

Submission status: Accepted

Solution code:
A,B,K=[int(x) for x in input().rstrip().split()]

if(0<A):
    if A<=K:
        
        K=K-A
        A=0
    else:
        A=A-K
        K=0

    
if(A==0 and 0<B):
    if B<=K:
        
        K=K-B
        B=0
    else:
        B=B-K
        K=0
print(A,B)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
 
if a<=k:
    print(0,max(b-k+a,0))
else:
    print(a-k,b)

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque
import re
import math
import functools


def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29


def make1d_arr(n, val=INF):
    return [val for i in range(n)]


def make2d_arr(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]


def gcd(a, b):
    if(b == 0):
        return a
    return gcd(b, a % b)


def BFord(n, es):
    v_cost = [INF]*n
    v_cost[0] = 0
    for v in range(n*2):
        for e in es:
            frm = e[0]
            to = e[1]
            if v_cost[to] > v_cost[frm]+e[2]:
                v_cost[to] = v_cost[frm]+e[2]
                if v >= n:
                    v_cost[to] = -INF
        if v == n-1:
            prev = v_cost[:]
    v_cost = [-INF if prev[idx] != v_cost[idx] else v_cost[idx]
              for idx in range(n)]
    return v_cost


def ZAlgo(s):
    l = len(s)
    A = [0]*l
    i = 1
    j = 0
    A[0] = l
    while i < l:
        while i+j < l and s[j] == s[i+j]:
            j += 1
        if j == 0:
            i += 1
            continue
        A[i] = j
        k = 1
        while (i+k < l) and (k+A[k] < j):
            A[i+k] = A[k]
            k += 1
        i += k
        j -= k
    return A


DIV = 998244353


def main():
    A, B, K = isRaw()
    if K <= A:
        return (A-K, B)
    else:
        return (0, max(B-K+A, 0))


if __name__ == "__main__":

    print(" ".join([str(v) for v in main()]))

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if A-K >= 0:
    a = A-K
    b = B
elif K-A-B >= 0:
    a = 0
    b = 0
else:
    a = 0
    b = B-(K-A)

print(a, b)

Submission status: Accepted

Solution code:
N = list(input().split(" "))
A = int(N[0])
B = int(N[1])
K = int(N[2])

if K >= A + B:
    print("0 0")
elif K >= A:
    print("0 ",B - (K -A))
else:
    print(A-K," ",B)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
minAK = min(A, K)
A -= minAK
K -= minAK
B -= min(B, K)

print(A, B)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if(A >= K):
	print(str(A-K) + " " + str(B))
elif(A + B >= K):
	print(str(0) + " " + str(A + B - K))
else:
	print(str(0) + " " + str(0))

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())

if(K<=A):
    A=A-K
else:
    K=K-A
    A=0
    if(K<=B):
        B=B-K
    else:
        B=0

print(str(A)+" "+str(B))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A, B, K = map(int, input().split())
if K > A:
  K -= A
  A = 0
  B = max(0, B - K)
  print(A, B)
else:
  A -= K
  print(A, B)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if K <= A:
    print(A - K, B)
else:
    print(0, max(0, A + B - K))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a - k <= 0:
    T = 0
    if b - (k - a) <= 0:
        A = 0
    else:
        A = b - (k - a)
else:
    T = a - k
    A = b

print(T, A)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
    print(a-k, b)
else:
    print(0, max(0, b-(k-a)))

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if K > A:
  A, K = 0, K - A
  if K > B:
    B = 0
  else:
    B -= K
else:
  A -= K
  
print(A, B)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
  ans_a = a - k
  ans_b = b
elif a < k and b + (a - k) >= 0:
  ans_a = 0
  ans_b = b + (a - k)
else:
  ans_a = 0
  ans_b = 0

print(str(ans_a) + ' ' + str(ans_b))

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if(A >= K):
    print(str(A-K) + " " + str(B))
elif(A+B >= K):
    ret = B-(K-A)
    print(str(0) + " " + str(ret))
else:
    print("0 0")

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if A+B-K > 0:
  if A > K:
    print(A-K, B)
  else:
    print(0, B-(K-A))
  a = (A-K)
else:
  print(0, 0)

Submission status: Accepted

Solution code:
a,b,k = map(int, input().split())

if a >= k:
  print(a-k, b)
elif b >= k-a:
  print(0, b-k+a)
else:
  print(0, 0)

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())
if k >= a:
    k -= a
    a = 0
    if k >= b:
        b = 0
    else:
        b -= k
else:
    a -= k
print(str(a) + " " + str(b))

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if A >= K:
    print(str(A - K) + ' ' + str(B))

if A < K:
    ans = B - (K - A)
    if ans >= 0:
        print('0' + ' ' + str(ans))
    else:
        print('0 0')

Submission status: Accepted

Solution code:
A,B,K=map(int,input().split())

if A>=K:
  print(A-K,B)
elif (A+B)>=K:
  print(0,A+B-K)
else:
  print(0,0)

Submission status: Accepted

Solution code:
# 2019/12/29

a,b,k=map(int,input().split())

if a>=k:
    a-=k
else:
    a,b=0,max(b-(k-a),0)
print(a,b,sep=' ')

Submission status: Accepted

Solution code:
A,B,K = map(int, input().split())

if A >= K:
    A -= K
elif A <= K:
    B = max(0, B - (K - A))
    A = 0

print(A, B)

Submission status: Accepted

Solution code:
a, b, k = map(int, open(0).read().split())
if a <= k:
    print(0,max(a+b-k,0))
else:
    print(a-k,b)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
if K<A:print(A-K,B)
else:print(0,max(0,B-K+A))

Submission status: Accepted

Solution code:
import numpy as np

ABK=np.array(input().split(),dtype=np.int64)

A=ABK[0]
B=ABK[1]
K=ABK[2]

if(A>=K):
    A=A-K
else:
    if(B>=K-A):
        B=B-(K-A)
    else:
        B=0
    A=0

print("{} {}".format(A,B))

Submission status: Accepted

Solution code:
A,B,K=map(int, raw_input().split())

min_a_k=min(A,K)
A-=min_a_k
K-=min_a_k

min_b_k=min(B,K)
B-=min_b_k
print A,B

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
    print(a-k, b)
elif a+b-k >= 0:
    print(0, a+b-k)
else:
    print(0, 0)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split(' '))

if K - A > 0:
    print(0,max(0,(B - (K - A))))
else:
    print(A-K,B)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
if K > A:
    K = K - A
    A = 0
    B -= K
else:
    A -= K

print("{} {}".format(A,max(B,0)))

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())
if a >= k:
    a -= k
else:
    if b >= (k - a):
        b -= (k - a)
    else:
        b = 0
    a = 0

print (a,b)

Submission status: Accepted

Solution code:
a,b,k = map(int, input().split())

if a >= k:
	a -= k
else:
	k -= a
	a = 0
	b = max(0, b-k)
print(a, end = " ")
print(b)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())

amount = A + B

if K < A:
  print(A - K, B)
elif A <= K and amount > K:
  print(0,B - (K - A))
elif amount <= K:
  print(0,0)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if A>=K:
    A -= K
else:
    B = max(0, B - K + A)
    A = 0
print(A, B)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
 
if K <= A:
        print(A - K, B)
else:
        print(0, max(B - (K - A), 0))

Submission status: Accepted

Solution code:
A,B, K = map(int, input().split())
AB = [0,0]
if K <= A:
    AB[0] = A-K
    AB[1] = B
elif K <= A+B:
    AB[0] = 0
    AB[1] = B-(K-A)
else:
    AB[0] = 0
    AB[1] = 0
print(AB[0],AB[1])

Submission status: Accepted

Solution code:
def solve():
    A, B, K = map(int, input().split())

    ansA = max(0, A - K)
    if ansA > 0:
        ansB = B
    else:
        ansB = max(0, B - (K - A))

    print(ansA, ansB)
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
A, B, K=map(int, input().split())

if A>=K:
  print(A-K, B)
else:
  if A+B>=K:
    print(0, B-(K-A))
  else:
    print(0, 0)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
    a -= k
else:
    b -= k - a
    if b < 0:
        b = 0
    a = 0
print(str(a) + " " + str(b))

Submission status: Accepted

Solution code:
#B - Greedy Takahashi
A,B,K = list(map(int, input().split()))

if K>=A+B:
    N1 = 0
    N2 = 0
else:
    if K>=A:
        N1 = 0
        N2 = B-(K-A)
    else:
        N1 = A-K
        N2 = B

print(N1,N2)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
if A+B<=K:
    print("0"+" "+"0")
elif A-K>=0:
    print(str(A-K)+" "+str(B))
else:
    print("0"+" "+str(B-K+A))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
c = a - k
if c < 0:
    b = b + c
print(max(c, 0), max(b, 0))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
    print(a-k, b)
elif a < k:
    if k-a < b:
        print(0, b-(k-a))
    else:
        print(0, 0)

Submission status: Accepted

Solution code:
import sys
a,b,k = map(int,input().split())
if a-k <= 0:
    a1 = 0
else:
    print(a-k,b)
    sys.exit()
if b-(k-a) <= 0:
    print(0,0)
else:
    print(0,b-(k-a))

Submission status: Accepted

Solution code:
a, b, k = map(int , input().split())
ans = 0
if k >= a:
	ans = max(0,b-(k-a))
	print (0, ans)
else:
	print (a-k,b)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())


if a-k >0:
  a = a-k

else:
  if a+b <k:
    a=0
    b=0
  else:
    b=b-(k-a)
    a=0
    
print(a,b)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split(" "))

if A >= K:
    print(A - K, B)
elif B >= K - A:
    print(0, B - K + A)
else:
    print(0, 0)

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())
ansa = a - k
if ansa < 0:
    ansa = 0
if a < k :
    b = a + b -k

if b < 0:
    b =0
print(ansa,b)

Submission status: Accepted

Solution code:
A, B, K = map(int,input().split())

if(K >= A):
    K -= A
    A = 0
    if(K >= B):
        B = 0
    else:
        B -= K
else:
    A -= K

print(str(A) + " " + str(B))

Submission status: Accepted

Solution code:
a, b, k = [int(i) for i in input().split()]

if a <= k:
  k = k - a
  a = 0
else:
  a = a - k
  k = 0

if b <= k:
  k = k - b
  b = 0
else:
  b = b - k
  k = 0

print(a, b)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
if k > a:
    k -= a
    a = 0
    b -= k
    if b < 0:
        b = 0
elif k <= a:
    a -= k

print(a, b)

Submission status: Accepted

Solution code:
a, b, k =map(int, input().split())
if a>=k:
    aa = a-k
    ans=' '.join([str(aa), str(b)])
    print(ans)
else:
    if b>=k-a:
        bb = b-(k-a)
        ans = ' '.join([str(0), str(bb)])
        print(ans)
    else:
        ans = ' '.join([str(0), str(0)])
        print(ans)

Submission status: Accepted

Solution code:
a, b, k = map(int,input().split())

if a >= k:
    print("{0} {1}".format(a-k, b))
else:
    b2 = b - (k - a)
    if b2 < 0:
        b2 = 0
    print("{0} {1}".format(0, b2))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a < k:
    remain = k - a
    if remain >= b:
        print(0, 0)
    else:
        print(0, b - remain)
else:
    print(a-k, b)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
diff = min(A, K)
A = max(0, A - diff); K = max(0, K - diff)
B = max(0, B - K)
print(A, B)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
if A+B < K:
    A = 0
    B = 0
else:
    if A < K:
        B -= K-A
        A = 0
    else:
        A -= K

print(A, end=' ')
print(B)

Submission status: Accepted

Solution code:
temp = input().split()
a, b, k = int(temp[0]), int(temp[1]), int(temp[2])

takahashi = a-k
if takahashi < 0:
    aoki = b + takahashi
    takahashi = 0
    if aoki <= 0:
        aoki = 0
else:
    aoki = b

print("{} {}".format(takahashi, aoki))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
if k > a:
    k -= a
    a = 0
else:
    a -= k
    k = 0
if k > b:
    b = 0
else:
    b -= k
print(a, b)

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())

a -= k
if a >= 0:
    print(a,b)
elif b+a >= 0:
    print(0,b+a)
else:
    print(0,0)

Submission status: Accepted

Solution code:
ABK = input().split()
A = int(ABK[0])
B = int(ABK[1])
K = int(ABK[2])

tmp = A
if A < K:
  A = 0
else:
  A -= K
K = K - tmp

if K > 0:
  if B < K:
    B = 0
  else:
    B -= K

print(A,B)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
ak = a - k
if ak >= 0:
    print(ak, b)
    exit()
bk = b + ak
if bk >= 0:
    print(0, bk)
    exit()
print(0,0)

Submission status: Accepted

Solution code:
n = input().split()
a = int(n[0])
b = int(n[1])
k = int(n[2])

if a >= k:
    print(a-k, b)
else:
    if b >= (k-a):
        print(0, b-(k-a))
    else:
        print(0, 0)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

A, B, K = map(int, input().split())

if K <= A:
    print(A-K, B)
else:
    print(0, max(0, B-(K-A)))

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if K <= A:
    A -= K
elif K <= B:
    num = K - A
    A = 0
    B -= num
else:
    num = K - A
    A = 0
    B = B - num

print(max(A, 0), max(B, 0))

Submission status: Accepted

Solution code:
def main():
    a,b,k = map(int,input().split())
    if a >= k:
        print(str(a-k)+" "+str(b))
    elif a+b <= k:
        print("0 0")
    else:
        print("0 "+str(b+a-k))
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
ans = 0
if A >= K:
    print(A - K, B)
elif A < K <= A + B:
    print(0, B - (K - A))
else:
    print(0, 0)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
print(max(A-K, 0), max(0, B - max(0, (K - A))))

Submission status: Accepted

Solution code:
#coding:utf-8

a, b, k = map(int, input().split(' '))
if a < k:
    b -= (k - a)
    a = 0
    print(str(a) + ' ' + str(max(0, b)))
else:
    print(str(a - k) + ' ' + str(b))

Submission status: Accepted

Solution code:
a, b, k = list(map(int, input().split()))
if a >= k:
  print(a-k, b)
elif b > k-a:
  print(0, b-(k-a))
else:
  print(0,0)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

a = A - K
if a <= 0:
    ansA = 0
    minus = K - A

    ansB = B - minus
    if ansB <= 0:
        print("{} {}".format(ansA, 0))

    else:
        print("{} {}".format(ansA, ansB))

else:
    print("{} {}".format(a, B))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
if k >= a:
    b = b - (k - a)
    if b <= 0: b = 0
    a = 0
else:
    a -= k
print(a, b)

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

A, B, K = MI()

a = max(0, A - K)

if A - K >= 0:
    b = B
else:
    b = max(0, B + (A - K))

print("{0} {1}".format(a, b))

Submission status: Accepted

Solution code:
A,B,K = map(lambda x: int(x),input().split())
a = A-K
if a>=0:
  print(str(a)+" "+str(B))
else:
  b = max(0,B+a)
  print("0 "+str(b))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if k > 0 and k >= a:
  k -= a
  a = 0
else:
  a -= k
  k = 0

if k > 0 and k >= b:
  k -= b
  b = 0
else:
  b -= k
  k = 0

print('{} {}'.format(a, b))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if k >= a:
    k -= a
    a = 0
    if k > b:
        print(0, 0)
    else:
        b -= k
        print(a, b)
else:
    a -= k
    print(a, b)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

def main():
    A,B,K=map(int,input().split())
    ans=A-K if A-K>0 else 0
    ans2=B-(K-A if K-A >0 else 0)
    ans2=ans2 if ans2>0 else 0
    print(str(ans)+' '+str(ans2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())

if a>k:
    print(a-k, end=" ")
    print(b)
elif a+b >= k:
    print(0, end=" ")
    print(a+b-k)
else:
    print("0 0")

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if A+B<=K:
    print("0 0")
elif A <= K:
    print("0 "+str(A+B-K))
else:
    print(str(A-K)+" "+str(B))

Submission status: Accepted

Solution code:
a, b, K = map(int, input().split())
if a > K:
    print(a - K, b)
elif b > (K-a):
    print(0, b-(K-a))
else:
    print(0, 0)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if A > K:
    print(A - K, B)
elif A + B > K:
    print(0, B - (K - A))
else: #elif A + B < K:
    print(0, 0)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())

if A >= K:
    print(A-K,B)
else:
    print(0,max(0,A+B-K))

Submission status: Accepted

Solution code:
(W, H, N), = [list(map(int, s.split())) for s in open(0)]
if N >= W:
    N -= W
    W = 0
    H -= N
else:
    W -= N

if H < 0:
    H = 0
print(W, H)

Submission status: Accepted

Solution code:
a,b,k=map(int,input().split())
if k<=a:
  print(a-k,b)
elif a<=k<=a+b:
  print(0,a+b-k)
else:
  print(0,0)

Submission status: Accepted

Solution code:
# import numpy as np
# import math
import sys
input = sys.stdin.readline

A,B,K = map(int,input().split())

if A >= K:
    A -= K
    print(A,B)
    sys.exit()
elif A < K:
    K -= A
    A = 0
    if B >= K:
        B -= K
        print(A,B)
        sys.exit()
    elif B < K:
        K -= B
        B = 0

print(A,B)

Submission status: Accepted

Solution code:
#input
A, B, K = map(int, input().split())

#output
if A+B <= K:
    print(0, 0, sep = " ")
elif A < K <= A+B:
    print(0, B-(K-A), sep = " ")
else:
    print(A-K, B, sep = " ")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
rem = min(a,c)
a-=rem
c-=rem
rem = min(b,c)
b-=rem
print(a,b)

Submission status: Accepted

Solution code:
from sys import stdin
A,B,K = [int(x) for x in stdin.readline().rstrip().split()]

t = A
a = B

t -= min(A,K)
a -= (K-min(A,K))

print(t,max(a,0))

Submission status: Accepted

Solution code:
a,b, k = map(int, input().split())
if k >= a:
    k -= a
    a = 0
else:
    a-=k
    k = 0
    print(a,b)
    exit()
if k >= b:
    k -= b
    b = 0
else:
    b -= k
    k = 0
print(a,b)

Submission status: Accepted

Solution code:
t, a, k = list(map(int, input().split()))
if t >= k:
    t -= k
    k = 0
else:
    k -= t
    t = 0
if a >= k:
    a -= k
    k = 0
else:
    k -= a
    a = 0
print("{} {}".format(t, a))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if c>a:
    a,c=0,c-a
    b-=c
    b=max(0,b)
else:
    a-=c
print(a,b)

Submission status: Accepted

Solution code:
A,B,K = list(map(int,input().split()))

if 0 < A:
    if A <= K:
        K -= A
        A = 0
    else:
        A -= K
        K = 0
        
if 0 < B and 0 < K:
    if B <= K:
        K -= B
        B = 0
    else:
        B -= K
        K = 0        

print(A,end=" ")
print(B)

Submission status: Accepted

Solution code:
a,b,k=map(int,input().split())
if a>=k:
    x = a-k
    print(x,b)
else:
    x=k-a
    if b>=x:
        y=b-x
        print(0,y)
    else:
        y=0
        print(0,0)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
min_cookie = min(a, k)
a -= min_cookie
k -= min_cookie

min_cookie = min(b, k)
b -= min_cookie
print(a, b)

Submission status: Accepted

Solution code:
a , b, k =map(int,input().split())
if a >= k:
    print(a-k, b)
elif int(a+b) >=k:
    print(0, b - k +a)
else:
    print(0,0)

Submission status: Accepted

Solution code:
def main():
    a, b, k = [int(x) for x in input().split()]
    if k > (a + b):
        a = 0
        b = 0
    elif k > a:
        b = b - (k - a)
        a = 0
    else:
        a -= k

    print(a, b)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,k=map(int,input().split())
d=min(a,k)
a-=d
k-=d
d=min(b,k)
b-=d
k-=d
print(a,b)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
  a = a-k
else:
  b = b-k+a
  a = 0

b = max(b,0)
print(a,b)

Submission status: Accepted

Solution code:
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    a,b,k=MI()
    if k>=a:
        k-=a
        a=0
        # print(k)
        if k>=b:
            k-=b
            b=0
        else:
            b=b-k
    else:
        a=a-k
    print(a,b)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,K=list(map(int,input().split()))
ans=[]
if A>=K:
    ans.append(A-K)
    ans.append(B)
elif A<=K and A+B>=K:
    ans.append(0)
    ans.append(B+A-K)
else:
    ans.append(0)
    ans.append(0)
print(*ans)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
if A >= K:
    print(A-K,B)
else:
    print(0,max(0,B-(K-A)))

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split(" "))
if a + b <= k:
    print('0 0')
    exit()
else:
    if k > a:
        b = b - k + a
        a = 0
    elif k <= a:
        a = a-k
    print(str(a) + ' ' + str(b))

Submission status: Accepted

Solution code:
# print('input >>')
A, B, K = map(int,(input().split()))

# print('-----output-----')
if K < A:
    print(A-K, B)
elif K < (A + B):
    print(0, (A+B)-K)
else:
    print(0, 0)

Submission status: Accepted

Solution code:
a,b,k = [int(i) for i in input().split()]

h = a - k
if h >= 0:
    print(str(h) + ' ' + str(b))
else:
    b += h
    if b >=0:
        print('0 ' + str(b))
    else:
        print('0 0')

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
def main():
    A, B, K = map( int, input().split())
    if A >= K:
        print(A-K, B)
        return
    K -= A
    if B >= K:
        print(0, B-K)
        return
    print(0, 0)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
a,b,k = [int(x) for x in stdin.readline().rstrip().split()]
if k >= a:
    k = k-a
    a = 0
else:
    a -= k
    k = 0
if k <= b:
    b = b - k
else:
    b = 0
print(a,b)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b, k = map(int, input().split())
if a - k >= 0:
    print(a-k, b)
else:
    x = k - a
    if b - x >= 0:
        print(0, b - x)
    else:
        print(0, 0)

Submission status: Accepted

Solution code:
A, B, K = raw_input().split()
A, B, K = int(A), int(B), int(K)


if K >= A+B:
    print '0 0'
elif K >= A:
    K -= A
    print '0 {}'.format(B-K)
else:
    print '{} {}'.format(A-K, B)

Submission status: Accepted

Solution code:
A, B, K = [int(i) for i in input().split()]

if A >= K:
  print(A-K, B)
else:
  print(0, max(0, B-(K-A)))

Submission status: Accepted

Solution code:
A,B,K=map(int,input().split())

if A>K:
  print(A-K,B)
elif A+B>K:
  print(0,A+B-K)
else:
  print(0,0)

Submission status: Accepted

Solution code:
A, B, K = map(int,input().split())

if K >= A:
    print(0, max(B-(K-A), 0))
else:
    print(A-K, B)

Submission status: Accepted

Solution code:
A, B, K = map(int,input().split())

if A >= K:
  print(str(A - K) + ' ' + str(B))
elif (A + B) >= K:
  print('0 ' + str(A + B - K))
else:
  print('0 0')

Submission status: Accepted

Solution code:
a,b,k = map(int, input().split())
if a>=k:
    print(a-k,b)
else:
    print(0,max(0,b-k+a))

Submission status: Accepted

Solution code:
a,b,k=map(int,input().split())
if a>=k:
  print(a-k,b)
elif a<k and k-a<=b:
  print(0,b-k+a)
else:
  print(0,0)

Submission status: Accepted

Solution code:
a, b, k = [ int(v) for v in input().split() ]

if k > a:
    k -= a
    a = 0
    b -= min(b, k)
else :
    a -= k
print(a, b)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
if a >= k:
    a-=k
else:
    k = k-a
    a = 0
    b -=k
if a <= 0:
    a = 0
if b <= 0:
    b = 0
print(a, b)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

def test(a, b, k):
    if k - a > 0:
        kk = k - a
        return 0, max(0, b - kk)

    else:
        return a-k, b

ans = test(a, b, k)
print(*ans)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if A >= K:
    print(A - K, B)
else:
    x = K - A
    print(0, max(0, B - x))

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

t = min(A, K)
A -= t
K -= t
B = max(B - K, 0)

print(A, B)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if A > K:
    print(A-K,B)
elif A+B > K:
    print(0, B-(K-A))
else:
    print(0,0)

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())

if a >= k:
    print(a-k, b)
elif a + b >= k:
    print(0, b-(k-a))
else:
    print(0, 0)

Submission status: Accepted

Solution code:
a,b,k=map(int,input().split())
count1=0
count2=0
if a<=k:
  count1=0
  if b-(k-a)>0:
    count2=b-(k-a)
  else:
    count2=0
else:
  count1=a-k
  count2=b
print(str(count1)+' '+str(count2))

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split(" ")]

if c <= a:
    print("{} {}".format(a - c, b))
elif c - a <= b:
    print("{} {}".format(0, b - c + a))
else:
    print("0 0")

Submission status: Accepted

Solution code:
A,B,K = [int(i) for i in input().split()]

if K>A:
    if K >= A+B:
        print("0 0")
    else:
        print("%d %d"%(0, B-(K-A)))
else:
    print("%d %d"%(A-K, B))

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())
if a >= k:
    print(a-k,b)
else:
    print(0, max(0,b+a-k))

Submission status: Accepted

Solution code:
a,b,k = map(int, input().split())

d = min(a,k)
a -= d
k -= d
b -= min(b,k)

print(a,b)

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())

if a-k >0:
    print("{} {}".format(a-k,b))
elif a+b-k>0:
    c = 0
    print("{} {}".format(c,a+b-k))
else:
    print("0 0")

Submission status: Accepted

Solution code:
A,B,K=map(int, input().split())
# A,B,K=5,3,3
if A>=K:
    A=A-K
    print(A,B)
else:
    B=B-(K-A)
    print(0,max(0,B))

Submission status: Accepted

Solution code:
A,B,K=map(int,input().split())

if K-(A+B)>=0:
    print(0,0)
else:
    if K>=A:
        print(0,B-(K-A))
    else:
        print(A-K,B)

Submission status: Accepted

Solution code:
import sys

def solve():
    A, B, K = map(int, input().split())
    if A <= K:
        K -= A
        A = 0
    else:
        A -= K
        K = 0

    if K > 0:
        if B <= K:
            K -= B
            B = 0
        else:
            B -= K
            K = 0
    print(A, B)

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
A, B, K = map( int, input().split() )
if K>A+B : 
  print( 0, 0 )
elif K>A : 
  print( 0, B - (K-A) )
else : 
  print( A - K, B )

Submission status: Accepted

Solution code:
a, b, k = map(int, input().split())
if a <= k:
    b -= k-a
    a = 0
    b = max(b, 0)
else:
    a -= k

print(a,b)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
if A >= K:
    A = A - K
elif (A + B) >= K:
    B = B - (K - A)
    A = 0
else:
    A = 0
    B = 0

print(str(A) + ' ' + str(B))

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
A = A - K
if A >= 0:
    print(A,B)
else:
    B = B + A
    if B >= 0:
        print(0,B)
    else:
        print(0,0)

Submission status: Accepted

Solution code:
def main():
    A, B, K = map(int, input().split())
    C = max(A - K , 0)
    K = max(K - A , 0)
    D = max(B - K , 0)
    print(C, D)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())

if A > K:
    print('{} {}'.format(A - K, B))
else:
    print('0 {}'.format(max(0, B - (K - A))))

Submission status: Accepted

Solution code:
A,B,K = list(map(int,input().split()))
 
if K<=A:
    print(A-K,B)
elif K<=A+B:
    print(0,B+A-K)
else:
    print(0,0)

Submission status: Accepted

Solution code:
A, B, K = map(int, input().split())
ans_a = 0
ans_b = 0
if A > K:
  ans_a = A - K
  ans_b = B
else:
  ans_a = 0
  if B > K - A:
    ans_b = (B-(K-A))
  else:
    ans_b = 0
print("{} {}".format(ans_a,ans_b))

Submission status: Accepted

Solution code:
a,b,k = [int(i)for i in input().split()]
if k>=a:
    rem = k-a
    a = 0
    b-=rem
    b = max(b,0)
    print(a,b)
else:
    print(a-k,b)

Submission status: Accepted

Solution code:
a,b,k = map(int,input().split())

if a>=k:
    print(int(a-k),b)
else:
    if a+b>=k:
        print(0,int(a+b-k))
    else:
        print(0,0)