Problem:
 Score : 200 points    Problem Statement 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       Output Print the maximum possible sum of the numbers written on the cards chosen.        Sample Input 1 2 1 1 3      Sample 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.       Sample Input 2 1 2 3 4      Sample Output 2 0       Sample Input 3 2000000000 0 0 2000000000      Sample Output 3 2000000000

Solution (Python):





def main():
    A, B, C, K = map(int, input().split())

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

    print(mv)


if __name__ == "__main__":
    main()

Solution (Python):
A,B,C,K = map(int,input().split())
d = K - A
e = K - A - B

if d > 0:
    if e > 0:
        print(A-min(K-A-B,C))
    else:
        print(A)
else:
    print(K)

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

if K <= A:
    print(K)
elif K <= A+B:
    print(A)
else:
    print(A - (K-(A+B)))

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

cnt = 0
cntA = min(A, K)

K -= cntA
if K == 0:
    print(cntA)
    exit()

cntB = min(B, K)
K -= cntB

if K == 0:
    print(cntA)
    exit()

cntC = min(C, K)
K -= cntC

print(cntA - cntC)
exit()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C, K = MAP()

if K < A:
	print(K)
elif A <= K <= A+B:
	print(A)
elif K > A+B:
	print(A - (K-A-B))

Solution (Python):
from collections import defaultdict

a,b,c,k=map(int, input().split())
ans=0
if a>=k:
    print(k)
else:
    ans+=a
    k-=a
    if b>=k:
        pass
    else:
        k-=b

        ans-=k

    print(ans)

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

if K <= A:
    print(K)
elif A < K <= A+B:
    print(A)
else:
    print(A-(K - A - B))

Solution (Python):

a, b, c, k = map(int, input().split())
i = min(a, k)
k -= i
k -= min(b, k)
print(i-k)

Solution (Python):

import sys

sys.setrecursionlimit(10 ** 8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, B, C, K = map(int, readline().split())


def solve():
    if K <= A:
        return K
    elif K <= A + B:
        return A
    else:
        r = K - A - B
        return A - r


if __name__ == "__main__":
    print(solve())

Solution (Python):
inpl = lambda: list(map(int,input().split()))
A, B, C, K = inpl()
if K <= A:
    print(K)
elif K <= A+B:
    print(A)
else:
    print(A - (K-A-B))

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product, combinations_with_replacement
import sys
import bisect
import string
import math
import time


def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def print_matrix(mat):
    for i in range(len(mat)):
        print(*['IINF' if v == IINF else "{:0=4}".format(v) for v in mat[i]])


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False


def main():
    A, B, C, K = MI()
    ans = 0

    ans += min(A, K)
    K -= A

    if K <= 0:
        print(ans)
        return

    K -= B

    if K <= 0:
        print(ans)
        return

    ans -= K

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    A, B, C, K = map(int, input().split())
    sumL = 0
    if K <= A: 
        sumL += K
        K = 0
    else:
        sumL += A
        K -= A
    if K > B:
        K -= B
    else: K = 0
    if K > 0: sumL -= K
    print(sumL)

    return  0

if __name__ == "__main__":
    solve()

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

Solution (Python):


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

a = min(A, K)
b = min(B, K - a)
c = min(C, K - a - b)

print(1 * a + b * 0 + c * -1)

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

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

if A>=K:
    print(K)
elif A+B>=K:
    print(A)
else:
    ans=A
    r=K-(A+B)
    ans-=r
    print(ans)

Solution (Python):
def resolve():
    A,B,C,K = map(int,input().split())

    score = 0

    if A >= K:
        print(K)
        return
    else:
        K-=A
        score+=A
    
    if B >= K:
        print(score)
        return
    else:
        K-=B
    
    print(score-K)







if __name__ == "__main__":
    resolve()

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

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

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

if K<A:
  print(K)
elif K<A+B:
  print(A)
else:
  print(A-(K-A-B))

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

Solution (Python):
a,b,c,k=map(int,input().split(" "))
if a >= k:
  print(k)
elif b >= k-a:
  print(a)
else:
  print(2*a+b-k)

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    A, B, C, K = R()
    if K <= A:
        print(K)
    elif K <= A + B:
        print(A)
    else:
        print(A-(K-A-B))

        
    
    
    

    
    
    


    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

ia = min(max(0, k), a)
ib = min(max(0, k - ia), b)
ic = min(max(0, k - ia - ib), c)


answer = ia * 1 + ib * 0 + ic * (-1)
print(answer)

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

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

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

n_B = min(K, B)
K -= n_B

n_C = min(K, C)
K -= n_C

print(n_A - n_C)

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

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

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

Solution (Python):

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

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

Solution (Python):
import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

a,b,c,k=mp()
if k<=a:
    print(k)
elif k<=a+b:
    print(a)
else:
    print(2*a-k+b)

Solution (Python):

import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a,b,c,k = MAP()

if(k<=a):
    print(k)
else:
    temp = k-a
    if(temp<=b):
        print(a)
    else:
        print(a-(k-a-b))

Solution (Python):
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

def read_int_list():
    return list(map(int,input().split(' ')))

def read_s_list_loop(n):
    return [input() for _ in range(n)]

A,B,C,K = read_int_map()
if K <= A:
    print(K)
elif K <= A + B:
    print(A)
else:
    minus = K - (A+B)
    print(A - minus)

Solution (Python):

import sys

def main():
    A, B, C, K = map(int, input().split())
    if K <= A+B:
        print(min(K,A))
    else:
        print(A-(K-A-B))

if __name__ == '__main__':
    main()

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

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

Solution (Python):
a, b, c, k = list(map(int, input().split(' ')))

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

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

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

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

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

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

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

if k <= a:
    print(k)
elif a < k and k <= a+b:
    print(a)
elif a+b < k:
    minus = k - (a+b)
    print(a-minus)

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

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

ans = min(A, K) - max(K - A - B, 0)
print(ans)

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)  
to_index = lambda x: int(x) - 1  
print_list_in_2D = lambda x: print(*x, sep="\n")  


def input_int():
    return int(input())

def map_int_input():
    return map(int, input())

MII = map_int_input

def MII_split():
    return map(int, input().split())

def MII_to_index():
    return map(to_index, input())

def MII_split_to_index():
    return map(to_index, input().split())


def list_int_inputs():
    return list(map(int, input()))

LII = list_int_inputs

def LII_split():
    return list(map(int, input().split()))


def LII_2D(rows_number):
    return [LII() for _ in range(rows_number)]

def LII_split_2D(rows_number):
    return [LII_split() for _ in range(rows_number)]

A, B, C, K = MII_split()

if K <= A:
    print(K)
elif K <= A + B:
    print(A)
else:
    c = K - A - B
    print(A - c)

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

Solution (Python):

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



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

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

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

Solution (Python):
A, B, C, D = list(map(int, input().split()))

ones = min(A, D)

A -= ones
D -= ones

zeros = min(B, D)

B -= zeros
D -= zeros

C = min(C, D)

print(ones - C)

Solution (Python):
a,b,c,k = list(map(int, input().split()))

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

Solution (Python):


import sys

sys.setrecursionlimit(10 ** 7)



INF = float("inf")
MOD = 10 ** 9 + 7


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

ans = 0
ans += min(K, A)
K -= min(K, A)
if K > 0:
    K -= min(K, B)
if K > 0:
    ans -= min(K, C)

print(ans)

Solution (Python):
A, B, C, K = map(int, input().split())
if K <= A:
    print(K)
elif K <= A + B:
    print(A)
else:
    excess = K - A - B
    print(A - excess)

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

Solution (Python):
a,b,c,k = map(int,input().split())
ans = min(a,k)
if ans<k:
	k-=ans
	k -= b
	if k>0:
		ans-=min(c,k)
print(ans)

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


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

Solution (Python):

import sys


def solve(A: int, B: int, C: int, K: int):

    a = K - A
    if a <= 0:
        print(K)
        return
    b = a - B
    if b <= 0:
        print(A)
        return
    c = b - C
    print(A-b)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    K = int(next(tokens))  
    solve(A, B, C, K)

if __name__ == '__main__':
    main()

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

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

ans = 0
if A < K:
    ans += A
    K -= A
else:
    ans += K
    print (ans)
    exit()

if B < K:
    K -= B
else:
    print (ans)
    exit()

print (ans - K)

Solution (Python):
a,b,c,k = map(int, input().split())
if k <= a+b:
  print(min(a,k))
else:
  minus = k-a-b
  print(a-minus)

Solution (Python):
a,b,c,k = map(int, input().split())
if k <= a:
    print(k)
elif k <= a+b:
    print(a)
else:
    print((k-(a+b))*-1 + a)

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

if K <= A:
  print(K)
elif K <= A + B:
  print(A)
else:
  print(2*A + B - K)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    a, b, c, k = list(map(int, readline().split()))
    if a + b >= k:
        print(min(a, k))
    else:
        print(a - (k - a - b))


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c, k = map(int, input().split())
if a + b >= k:
    print(min(a, k))
else:
    print(a - (k - a - b))

Solution (Python):
def main():
    a, b, c, d = map(int, input().split())
    ans = 0
    if a < d:
        ans += a
        d -= a
    else:
        ans += d
        d = 0
    if b < d:
        d -= b
    else:
        d = 0
    if c < d:
        ans -= a
        d -= c
    else:
        ans -= d
        d = 0
    print(ans)


main()

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

ans = 0
d = min(A, K)

ans += d
K -= d
d = min(B, K)

ans += 0
K -= d
d = min(C, K)

ans -= d
K -= d

print(ans)