Submission #35133986

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
from bisect import bisect
def D(N, K, A):
    ans = 0
    i = 0
    while N >= A[0]:
        get = A[bisect(A, N) - 1]
        if i % 2 == 0: ans += get
        N -= get
        i += 1
    return ans
N, K = map(int, input().split())
*A, = map(int, input().split())
print(D(N, K, A))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from bisect import bisect
def D(N, K, A):
    ans = 0
    i = 0
    while N >= A[0]:
        get = A[bisect(A, N) - 1]
        if i % 2 == 0: ans += get
        N -= get
        i += 1
    return ans

N, K = map(int, input().split())
*A, = map(int, input().split())
print(D(N, K, A))

Submission Info

Judge Result