problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02784
|
s = input().split()
s2 = list(map(int, input().split()))
if sum(s2) >= int(s[0]):
print("YES")
else:
print("NO")
|
s = input().split() # s[0]は体力, s[1]は攻撃の種類
s2 = list(map(int, input().split())) # 必殺技のリスト
# print(sum(s2))
if sum(s2) >= int(s[0]):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 587,234
| 587,233
|
u991923581
|
python
|
p02784
|
H,N=map(int, input().split())
arr = list(map(int, input().split()))
if H<=sum(arr):
print("YES")
else:
print("NO")
|
H,N=map(int, input().split())
arr = list(map(int, input().split()))
if H<=sum(arr):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 587,279
| 587,280
|
u821135866
|
python
|
p02784
|
import os
import sys
def main():
H , A = map(int , input().split())
list = [s for s in input().split()]
c = sum(int(i) for i in list)
if c > H :
print ('Yes')
else :
print ('No')
#print (str(X))
if __name__ == '__main__':
main()
|
import os
import sys
def main():
H , A = map(int , input().split())
list = [s for s in input().split()]
c = sum(int(i) for i in list)
if c >= H :
print ('Yes')
else :
print ('No')
#print (str(X))
if __name__ == '__main__':
main()
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 587,282
| 587,283
|
u015084832
|
python
|
p02784
|
H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= H:
ans = "YES"
else:
ans = "NO"
|
H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= H:
ans = "Yes"
else:
ans = "No"
print(ans)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"call.add"
] | 587,284
| 587,285
|
u863150907
|
python
|
p02785
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if n>k:
ans=0
for i in range(n-k-1):
ans+=h[i]
print(ans)
else:
print(0)
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if n>k:
ans=0
for i in range(n-k):
ans+=h[i]
print(ans)
else:
print(0)
|
[
"expression.operation.binary.remove"
] | 587,308
| 587,309
|
u333700164
|
python
|
p02785
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if n<k:
ans=0
for i in range(n-k-1):
ans+=h[i]
print(ans)
else:
print(0)
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if n>k:
ans=0
for i in range(n-k):
ans+=h[i]
print(ans)
else:
print(0)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 587,310
| 587,309
|
u333700164
|
python
|
p02785
|
N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
H.soat(reverse=True)
H=H[K:]
H_cumsum=[0]
H_sum_=0
for n in range(len(H)):
H_sum_=H_sum_+H[n]
H_cumsum.append(H_sum_)
print(H_sum_)
|
N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
H.sort(reverse=True)
H=H[K:]
H_cumsum=[0]
H_sum_=0
for n in range(len(H)):
H_sum_=H_sum_+H[n]
H_cumsum.append(H_sum_)
print(H_sum_)
|
[
"identifier.change"
] | 587,318
| 587,319
|
u465101448
|
python
|
p02785
|
n,k = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
H.reverse()
if n <= k:
print(0)
else:
print(sum(H[k+1:len(H)]))
|
n,k = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
H.reverse()
if n <= k:
print(0)
else:
print(sum(H[k:n]))
|
[
"expression.operation.binary.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 587,320
| 587,321
|
u757274384
|
python
|
p02785
|
N,K = map(int,input().split())
H = list(map(int,input().split()))
if N<=K:
print(0)
else:
print(sum(H[:N-K]))
|
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
if N<=K:
print(0)
else:
print(sum(H[:N-K]))
|
[
"call.add"
] | 587,322
| 587,323
|
u408071652
|
python
|
p02785
|
n,m = map(int,input().split())
li=list(map(int,input().split()))
if m>=n:
print(0)
else:
sort(li)
print(sum(li[n-m:]))
|
n,m = map(int,input().split())
li=list(map(int,input().split()))
if m>=n:
print(0)
else:
li.sort()
print(sum(li[:n-m]))
|
[
"call.arguments.change"
] | 587,324
| 587,325
|
u746206084
|
python
|
p02785
|
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
print(sorted(H)[::-1][K:])
|
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
print(sum(sorted(H)[::-1][K:]))
|
[
"call.arguments.add",
"call.arguments.change"
] | 587,330
| 587,331
|
u723711163
|
python
|
p02785
|
n,k = map(int, input().split())
H = list(map(int, input().split()))
l = n-k
sorted(H)
if k >= n : print(0)
else:
print(sum(H[:l]))
|
n,k = map(int, input().split())
H = list(map(int, input().split()))
l = n-k
H.sort()
if k >= n : print(0)
else:
print(sum(H[:l]))
|
[
"call.remove",
"call.add"
] | 587,340
| 587,341
|
u681323954
|
python
|
p02785
|
#C
import heapq
N, K = map(int, input().split())
H = list(map(int, input().split()))
H = list(map(lambda x: x*(-1), H))
heapq.heapify(H)
if K >= N:
print(0)
else:
for _ in range(K):
heapq.heappop(H)
break
print(-sum(H))
|
#C
import heapq
N, K = map(int, input().split())
H = list(map(int, input().split()))
H = list(map(lambda x: x*(-1), H))
heapq.heapify(H)
if K >= N:
print(0)
else:
for _ in range(K):
heapq.heappop(H)
print(-sum(H))
|
[
"control_flow.break.remove"
] | 587,342
| 587,343
|
u982591663
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.reverse()
h = h[k:]
print(sum(h))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
h = h[k:]
print(sum(h))
|
[
"identifier.change"
] | 587,358
| 587,359
|
u049979154
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.reverse
h = h[k:]
print(sum(h))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
h = h[k:]
print(sum(h))
|
[
"call.add",
"call.arguments.add"
] | 587,361
| 587,359
|
u049979154
|
python
|
p02785
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
hsorted = sorted(h)
if k>=n:
print(0)
else:
print(sum(hsorted[k:n]))
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
hsorted = sorted(h, reverse=True)
if k>=n:
print(0)
else:
print(sum(hsorted[k:n]))
|
[
"call.arguments.add"
] | 587,362
| 587,363
|
u725133562
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
elif K == 0:
print(sum(H))
else:
H.sort()
H_hissatsued = H[:-K]
print(H_hissatsued)
print(sum(H_hissatsued))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
elif K == 0:
print(sum(H))
else:
H.sort()
H_hissatsued = H[:-K]
#print(H_hissatsued)
print(sum(H_hissatsued))
|
[
"call.remove"
] | 587,374
| 587,375
|
u189516107
|
python
|
p02785
|
N,K=map(int,input().split())
H=list(map(int,input().split()))
if N>K:
H.sort()
del H[N-K+1:]
print(sum(H))
else:
print(0)
|
N,K=map(int,input().split())
H=list(map(int,input().split()))
if N>K:
H.sort()
del H[N-K:]
print(sum(H))
else:
print(0)
|
[
"expression.operation.binary.remove"
] | 587,395
| 587,396
|
u507456172
|
python
|
p02785
|
n,k=map(int,input().split())
h=map(int,input().split())
h=sorted(h)
if n<=k:
print('0')
exit()
for i in range(k):
h[i-1]=0
print(sum(h))
|
n,k=map(int,input().split())
h=map(int,input().split())
h=sorted(h)
if n<=k:
print('0')
exit()
for i in range(k):
h[-i-1]=0
print(sum(h))
|
[
"expression.operation.unary.add"
] | 587,397
| 587,398
|
u460386402
|
python
|
p02785
|
N,K = map(int,input().split())
H = sorted(list(map(int,input().split())))
print(sum(H[:-K]))
|
N,K = map(int,input().split())
H = sorted(list(map(int,input().split())))
print(sum(H[:N-min(N,K)]))
|
[
"call.arguments.change",
"call.add"
] | 587,399
| 587,400
|
u759412327
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
print(sum(sorted(h)[:-k]))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
print(sum(sorted(h)[::-1][k:]))
|
[
"call.arguments.change"
] | 587,409
| 587,410
|
u347600233
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
print(sum(sorted(h)[:-k]))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
print(sum(sorted(h)[:max(0, n - k)]))
|
[
"call.add",
"call.arguments.change"
] | 587,409
| 587,411
|
u347600233
|
python
|
p02785
|
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n, k = MAP()
h = LIST()
h.sort()
if k >= n:
print(0)
else:
print(sum(h[k:]))
|
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n, k = MAP()
h = LIST()
h.sort(reverse=True)
if k >= n:
print(0)
else:
print(sum(h[k:]))
|
[
"call.arguments.keyword_argument.add"
] | 587,422
| 587,423
|
u612975321
|
python
|
p02785
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
if n<=k:
print(k)
else:
a=sorted(a)
b=n-k
ans=0
for x in range(n-k):
ans+=a[x]
print(ans+k)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
if n<=k:
print(0)
else:
a=sorted(a)
b=n-k
ans=0
for x in range(n-k):
ans+=a[x]
print(ans)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 587,443
| 587,444
|
u516554284
|
python
|
p02785
|
N, K = map(int,input().split())
Monsters = list(map(int,input().split()))
Monsters = sorted(Monsters)
for i in range(min(K,N)):
Monsters[i]=0
print(sum(Monsters))
|
N, K = map(int,input().split())
Monsters = list(map(int,input().split()))
Monsters.sort(reverse=True)
for i in range(min(K,N)):
Monsters[i]=0
print(sum(Monsters))
|
[
"call.add"
] | 587,447
| 587,448
|
u516949135
|
python
|
p02785
|
n,k,*h=map(int,open(0).read().split())
if k>=n:
print(0)
else:
h.sort
print(sum(h[:n-k]))
|
n,k,*h=map(int,open(0).read().split())
if k>=n:
print(0)
else:
h.sort()
print(sum(h[:n-k]))
|
[
"call.add"
] | 587,454
| 587,455
|
u446711904
|
python
|
p02785
|
special_moves = input().split(" ")
_, special_moves = int(inputs[0]), int(inputs[1])
health= input().split(" ")
health= [int(h) for h in health]
health.sort(reverse=True)
print(sum(health[special_moves:]))
|
special_moves = input().split(" ")
_, special_moves = int(special_moves [0]), int(special_moves [1])
health= input().split(" ")
health= [int(h) for h in health]
health.sort(reverse=True)
print(sum(health[special_moves:]))
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 587,458
| 587,459
|
u018679195
|
python
|
p02785
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse=True)
ans = 0
if k == 0 :
ans = sum(h)
elif k <= n :
for i in range(k):
h[i] = 0
print(sum(h))
else :
print(0)
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse=True)
if k == 0 :
print(sum(h))
elif k <= n :
for i in range(k):
h[i] = 0
print(sum(h))
else :
print(0)
|
[
"call.arguments.change"
] | 587,464
| 587,465
|
u453623947
|
python
|
p02785
|
n,k=map(int,input().split(' '))
l=list(map(int, input().split(' ')))
l=sorted(l)
print(sum(l[:n-k]))
|
n,k=map(int,input().split(' '))
l=list(map(int, input().split(' ')))
l=sorted(l)
print(sum(l[:max(n-k,0)]))
|
[
"call.add",
"call.arguments.add"
] | 587,468
| 587,469
|
u010379708
|
python
|
p02785
|
#153 Fennec vs Monster
n,k = map(int,input().split())
tairyoku = list(map(int,input().split()))
tairyoku.sort(reverse=True)
if k == 0:
print(sum(tairyoku))
else:
del tairyoku[:k]
print(tairyoku)
print(sum(tairyoku))
|
#153 Fennec vs Monster
n,k = map(int,input().split())
tairyoku = list(map(int,input().split()))
tairyoku.sort(reverse=True)
if k == 0:
print(sum(tairyoku))
else:
del tairyoku[:k]
print(sum(tairyoku))
|
[
"call.remove"
] | 587,492
| 587,493
|
u211805975
|
python
|
p02785
|
import sys
n, k, *h = map(int, sys.stdin.read().split())
def main():
print(sum(sorted(h)[:n-k]))
if __name__ == '__main__':
main()
|
import sys
n, k, *h = map(int, sys.stdin.read().split())
def main():
print(sum(sorted(h)[:max(0, n-k)]))
if __name__ == '__main__':
main()
|
[
"call.add",
"call.arguments.change"
] | 587,504
| 587,505
|
u254871849
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
print(h)
h.reverse()
print(sum(h[k:]))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
h.reverse()
print(sum(h[k:]))
|
[
"call.remove"
] | 587,506
| 587,507
|
u453055089
|
python
|
p02785
|
N, K = map(int, input().split())
A_list = list(map(int, input().split()))
n = len(A_list)
if N <= K:
print(0)
elif K == 0:
ans = sum(A_list)
print(ans)
else:
A_list.sort()
A_list.pop(-K)
ans = sum(A_list)
print(ans)
|
N, K = map(int, input().split())
A_list = list(map(int, input().split()))
n = len(A_list)
if N <= K:
print(0)
elif K == 0:
ans = sum(A_list)
print(ans)
else:
A_list.sort()
del A_list[-K:]
ans = sum(A_list)
print(ans)
|
[
"call.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 587,517
| 587,518
|
u568559987
|
python
|
p02785
|
import numpy as np
N,K = map(int,input().split())
H = np.array(list(input().split()),np.int64)
np.sort(H)
if K > N:
K = N
H[N-K:N] = 0
ans = np.sum(H)
print(ans)
|
import numpy as np
N,K = map(int,input().split())
H = np.array(list(input().split()),np.int64)
H = np.sort(H)
if K > N:
K = N
H[N-K:N] = 0
ans = np.sum(H)
print(ans)
|
[
"assignment.add"
] | 587,519
| 587,520
|
u026402121
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
ans = sum(H[:len(H) - K])
print(ans if N > K else N)
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
ans = sum(H[:len(H) - K])
print(ans if N > K else 0)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 587,533
| 587,534
|
u417096287
|
python
|
p02785
|
n, k = map(int, input().split())
h = sorted(map(int, input().split()))
x = 0
print(h)
if n - k <= 0:
print(0)
else:
for i in range(n-k):
x += h[i]
print(x)
|
n, k = map(int, input().split())
h = sorted(map(int, input().split()))
x = 0
if n - k <= 0:
print(0)
else:
for i in range(n-k):
x += h[i]
print(x)
|
[
"call.remove"
] | 587,535
| 587,536
|
u585348179
|
python
|
p02785
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if (N<=K):
print('O')
else:
print(sum(H[:-K]))
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if (N<=K):
print('0')
else:
print(sum(H[:N-K]))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 587,539
| 587,540
|
u779293207
|
python
|
p02785
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if (N<=K):
print('O')
else:
print(sum(H[:N-K]))
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if (N<=K):
print('0')
else:
print(sum(H[:N-K]))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 587,541
| 587,540
|
u779293207
|
python
|
p02785
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if N<=K:
print('0')
else:
print(sum(H[N-K:]))
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if (N<=K):
print('0')
else:
print(sum(H[:N-K]))
|
[
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 587,542
| 587,540
|
u779293207
|
python
|
p02785
|
import heapq
ceruleans, skills = map(int, input().split())
HP = list(map(lambda x: int(x) * (-1), input().split()))
for i in range(skills):
heapq.heappop(HP)
if HP == []:
break
print(- sum(HP))
|
import heapq
ceruleans, skills = map(int, input().split())
HP = list(map(lambda x: int(x) * (-1), input().split())) # OK! 次に進もうぜ
heapq.heapify(HP)
for i in range(skills):
heapq.heappop(HP)
if HP == []:
break
print(-sum(HP))
|
[
"call.add"
] | 587,550
| 587,551
|
u283782321
|
python
|
p02785
|
# 初期入力
N,K = (int(x) for x in input().split(" "))
H = list(map(int, input().split()))
tuujou_attack = 1
# N種類のモンスター、K回の必殺技、モンスターは H の体力
# 体力の多いモンスターから必殺技で倒す。必殺技が使えなくなったら通常攻撃
nokori_kaisu = 0
H_sorted = sorted(H)
if N <= K:
nokori_kaisu = 0
else:
nokori_hissatuwaza = N -K
nokori_kaisu = sum( H[:nokori_hissatuwaza] ) # 体力少ないほうから N-K まで、通常攻撃「１」
print(nokori_kaisu)
|
# 初期入力
N,K = (int(x) for x in input().split(" "))
H = list(map(int, input().split()))
tuujou_attack = 1
# N種類のモンスター、K回の必殺技、モンスターは H の体力
# 体力の多いモンスターから必殺技で倒す。必殺技が使えなくなったら通常攻撃
nokori_kaisu = 0
H_sorted = sorted(H)
if N <= K:
nokori_kaisu = 0
else:
nokori_hissatuwaza = N -K
# del H_sorted[nokori_hissatuwaza:]
nokori_kaisu = sum( H_sorted[:nokori_hissatuwaza] ) # 体力少ないほうから N-K まで、通常攻撃「１」
print(nokori_kaisu)
# print(H_sorted)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 587,564
| 587,565
|
u116038906
|
python
|
p02785
|
# 初期入力
N,K = (int(x) for x in input().split(" "))
H = list(map(int, input().split()))
tuujou_attack = 1
# N種類のモンスター、K回の必殺技、モンスターは H の体力
# 体力の多いモンスターから必殺技で倒す。必殺技が使えなくなったら通常攻撃
nokori_kaisu = 0
H_sorted = sorted(H)
if N <= K:
nokori_kaisu = 0
else:
nokori_hissatuwaza = N -K
del H[nokori_hissatuwaza:]
nokori_kaisu = sum( H ) # 体力少ないほうから N-K まで、通常攻撃「１」
print(nokori_kaisu)
|
# 初期入力
N,K = (int(x) for x in input().split(" "))
H = list(map(int, input().split()))
tuujou_attack = 1
# N種類のモンスター、K回の必殺技、モンスターは H の体力
# 体力の多いモンスターから必殺技で倒す。必殺技が使えなくなったら通常攻撃
nokori_kaisu = 0
H_sorted = sorted(H)
if N <= K:
nokori_kaisu = 0
else:
nokori_hissatuwaza = N -K
del H_sorted[nokori_hissatuwaza:]
nokori_kaisu = sum( H_sorted ) # 体力少ないほうから N-K まで、通常攻撃「１」
print(nokori_kaisu)
|
[
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 587,566
| 587,567
|
u116038906
|
python
|
p02785
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
del h[5]
print(sum(h))
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
del h[:k]
print(sum(h))
|
[
"variable_access.subscript.index.change"
] | 587,613
| 587,614
|
u932868243
|
python
|
p02785
|
N, K = map(int, input().split())
H = [int(h) for h in input().split()]
H = list(sorted(H, reverse = True))
print(H)
if len(H) <= K:
print(0)
else:
del H[0:K]
print(sum(H))
|
N, K = map(int, input().split())
H = [int(h) for h in input().split()]
H = list(sorted(H, reverse = True))
if len(H) <= K:
print(0)
else:
del H[0:K]
print(sum(H))
|
[
"call.remove"
] | 587,619
| 587,620
|
u552143188
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
if h == 0:
print(sum(h))
elif h >= n:
print(0)
else:
h.sort()
print(sum(h[:n-k]))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
if k == 0:
print(sum(h))
elif k >= n:
print(0)
else:
h.sort()
print(sum(h[:n-k]))
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 587,626
| 587,627
|
u067986264
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
if len(h) <= k:
print(0)
else:
for _ in range(k):
h.pop()
print(sum(h))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
if len(h) <= k:
print(0)
else:
for _ in range(k):
h.pop()
print(sum(h))
|
[] | 587,630
| 587,631
|
u860002137
|
python
|
p02785
|
import heapq
n, k = map(int, input().split())
h = [-1 * int(i) for i in input().split()]
heapq.heapify(h)
if n <= k:
print(0)
exit()
for i in range(k):
heapq.heappop(h)
print(sum(h))
|
import heapq
n, k = map(int, input().split())
h = [-1 * int(i) for i in input().split()]
heapq.heapify(h)
if n <= k:
print(0)
exit()
for i in range(k):
heapq.heappop(h)
print(-1*sum(h))
|
[
"expression.operation.binary.add"
] | 587,644
| 587,645
|
u185037583
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
print(sum(H[:N-K]))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
print(sum(H[:max(N-K, 0)]))
|
[
"call.add",
"call.arguments.add"
] | 587,665
| 587,666
|
u875541136
|
python
|
p02785
|
n,k = map(int,input().split())
a = list(map(int,input().split()))
b = sorted(a)
if n <= k:
print(0)
else:
c = 0
t = 0
while t < n-k:
c += a[t]
t += 1
print(c)
|
n,k = map(int,input().split())
a = list(map(int,input().split()))
b = sorted(a)
if n <= k:
print(0)
else:
c = 0
t = 0
while t < n-k:
c += b[t]
t += 1
print(c)
|
[
"identifier.change"
] | 587,671
| 587,672
|
u227085629
|
python
|
p02785
|
import numpy as np
n, k = map(int,input().split())
h = np.array(input().split(),dtype=int)
h.sort()
sum = 0
for i in range(k+1,n):
sum += h[i]
print(sum)
|
import numpy as np
n, k = map(int,input().split())
h = np.array(input().split(),dtype=int)
h.sort()
sum = 0
for i in range(n-k):
sum += h[i]
print(sum)
|
[
"call.arguments.change"
] | 587,673
| 587,674
|
u169350228
|
python
|
p02785
|
import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.stdin.readline().split()))
l = len(li)
t = 0
if l > k:
li.sort().reverse()
t = sum(li[k:])
print(t)
|
import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.stdin.readline().split()))
l = len(li)
t = 0
if l > k:
li.sort()
li.reverse()
t = sum(li[k:])
print(t)
|
[] | 587,675
| 587,676
|
u823885866
|
python
|
p02785
|
#入力部
n,k = map(int,input().split())
h = list(map(int,input().split()))
#攻撃:hを1減らす 必殺技:hをすべて減らす制限 k回
#hを降順にソート
h.sort(reverse = True)
#nがkより小さい時全部に必殺技が使えるから0
if n <= k:
print(0)
#体力が多い順に必殺技を使用して残った体力の合計を出力
else:
for i in range(k):
s[i] = 0
print(sum(s))
|
#入力部
n,k = map(int,input().split())
h = list(map(int,input().split()))
#攻撃:hを1減らす 必殺技:hをすべて減らす制限 k回
#hを降順にソート
h.sort(reverse = True)
#nがkより小さい時全部に必殺技が使えるから0
if n <= k:
print(0)
#体力が多い順に必殺技を使用して残った体力の合計を出力
else:
for i in range(k):
h[i] = 0
print(sum(h))
|
[
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 587,681
| 587,682
|
u805552010
|
python
|
p02785
|
a,b=map(int,input().split())
n=list(map(int,input().split()))
n.sort(reverse=True)
n[0:b-1]=[]
print(sum(n))
|
a,b=map(int,input().split())
n=list(map(int,input().split()))
n.sort(reverse=True)
n[0:b]=[]
print(sum(n))
|
[
"expression.operation.binary.remove"
] | 587,685
| 587,686
|
u631579948
|
python
|
p02785
|
N,K = map(int,input().split())
li = sorted(list(map(int,input().split())),reverse=True)
del(li[:K])
sum(li)
|
N,K = map(int,input().split())
li = sorted(list(map(int,input().split())),reverse=True)
del(li[:K])
print(sum(li))
|
[
"call.add",
"call.arguments.change"
] | 587,694
| 587,695
|
u772029934
|
python
|
p02785
|
N, K = map(int,input().split(' '))
H_ls = list(map(int, input().split(' ')))
H_ls.sort()
print(sum(H_ls[K:]))
|
N, K = map(int, input().split(' '))
H_ls = list(map(int, input().split(' ')))
H_ls.sort(reverse=True)
print(sum(H_ls[K:]))
|
[
"call.arguments.keyword_argument.add"
] | 587,700
| 587,701
|
u418149936
|
python
|
p02785
|
N, K = map(int,input().split(' '))
H_ls = list(map(int, input().split(' ')))
H_ls.sort()
print(sum(H_ls[K:]))
|
N, K = map(int,input().split(' '))
H_ls = list(map(int, input().split(' ')))
H_ls.sort(reverse=True)
print(sum(H_ls[K:]))
|
[
"call.arguments.keyword_argument.add"
] | 587,700
| 587,705
|
u418149936
|
python
|
p02785
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if len(H) < K:
print(0)
else:
print(sum(H[N-K:]))
|
N,K=map(int,input().split())
H=sorted(list(map(int,input().split())))
if len(H) < K:
print(0)
else:
print(sum(H[:N-K]))
|
[
"call.arguments.change"
] | 587,708
| 587,709
|
u510582860
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
# N<=Kの場合、全てのモンスターを必殺技で倒して終了
# N>Kの場合、N体のモンスターのうち、体力が高い順に、K体を必殺技で倒す
# 残ったモンスターは、攻撃によって倒す
H = sorted(H, reverse=True)
ans = K
if N > K: ans += sum(H[K:])
print(ans)
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
# N<=Kの場合、全てのモンスターを必殺技で倒して終了
# N>Kの場合、N体のモンスターのうち、体力が高い順に、K体を必殺技で倒す
# 残ったモンスターは、攻撃によって倒す
# 攻撃の回数を求める（必殺技は数えない）ことに注意する
# 計算量はO(NlogN)で間に合う
H = sorted(H, reverse=True)
ans = 0
if N > K: ans = sum(H[K:])
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 587,716
| 587,717
|
u309120194
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
# N<=Kの場合、全てのモンスターを必殺技で倒して終了
# N>Kの場合、N体のモンスターのうち、体力が高い順に、K体を必殺技で倒す
# 残ったモンスターは、攻撃によって倒す
H = sorted(H, reverse=True)
ans = K
if N > K: ans += sum(H[K:])
print(ans)
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
# N<=Kの場合、全てのモンスターを必殺技で倒して終了
# N>Kの場合、N体のモンスターのうち、体力が高い順に、K体を必殺技で倒す
# 残ったモンスターは、攻撃によって倒す
# 攻撃の回数を求める（必殺技は数えない）ことに注意する
H = sorted(H, reverse=True)
ans = 0
if N > K: ans = sum(H[K:])
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 587,716
| 587,718
|
u309120194
|
python
|
p02785
|
a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<=b:
print(0)
else:
for i in range(b):
e=e+c[-i]
print(d-e)
|
a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<=b:
print(0)
else:
for i in range(1,b+1):
e=e+c[-i]
print(d-e)
|
[
"call.arguments.add"
] | 587,739
| 587,740
|
u244836567
|
python
|
p02785
|
a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<=b:
print(0)
else:
for i in range(b):
e=e+c[-b]
print(d-e)
|
a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<=b:
print(0)
else:
for i in range(1,b+1):
e=e+c[-i]
print(d-e)
|
[
"call.arguments.add",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 587,741
| 587,740
|
u244836567
|
python
|
p02785
|
a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<b:
print(0)
else:
for i in range(b):
e=e+c[-b]
print(d-e)
|
a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<=b:
print(0)
else:
for i in range(1,b+1):
e=e+c[-i]
print(d-e)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.add",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 587,742
| 587,740
|
u244836567
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
else:
print(sum(H[:N-K]))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
if N <= K:
print(0)
else:
print(sum(H[:N-K]))
|
[
"call.add"
] | 587,743
| 587,744
|
u666550725
|
python
|
p02785
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverce=True)
ans = 0
if(k>=n):
ans = 0
else:
for i in range(k,n):
ans += h[i]
print(ans)
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse=True)
ans = 0
if(k>=n):
ans = 0
else:
for i in range(k,n):
ans += h[i]
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 587,747
| 587,748
|
u655048024
|
python
|
p02785
|
N,K = map(int,input().split())
if N<=K :
print(0)
else :
H = list(map(int,input().split()))
H.sort()
del H[-K:]
print(sum(H))
|
N,K = map(int,input().split())
if N<=K :
print(0)
else :
H = list(map(int,input().split()))
H.sort()
if 0<K :
del H[-K:]
print(sum(H))
|
[
"control_flow.branch.if.add"
] | 587,766
| 587,767
|
u192433528
|
python
|
p02785
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
if k>n:
k=n
for i in range(k):
h[i]=0
sum_=0
for hh in range(h):
sum_+=hh
print(sum_)
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
if k>n:
k=n
for i in range(k):
h[i]=0
sum_=0
for hh in h:
sum_+=hh
print(sum_)
|
[
"call.remove",
"call.arguments.change"
] | 587,782
| 587,783
|
u087118202
|
python
|
p02785
|
a,b=map(int,input().split())
l=list(map(int,input().split()))
z=0
sorted(l)
for i in range(a-b):
z+=l[i]
print(z)
|
a,b=map(int,input().split())
l=list(map(int,input().split()))
z=0
l=sorted(l)
for i in range(a-b):
z+=l[i]
print(z)
|
[
"assignment.add"
] | 587,787
| 587,788
|
u158290747
|
python
|
p02785
|
N, K = map(int,input().split())
H = list(map(int,input().split()))
result = 0
if len(H) <= K:
print(result)
else:
H.sort()
result = sum(H[0:N-K-1])
print(result)
|
N, K = map(int,input().split())
H = list(map(int,input().split()))
result = 0
if len(H) <= K:
print(result)
else:
H.sort()
result = sum(H[0:N-K])
print(result)
|
[
"expression.operation.binary.remove"
] | 587,819
| 587,820
|
u629560745
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
H = h[k:]
sum_ = sum(H)
print(sum_)
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h, reverse=True)
H = h[k:]
sum_ = sum(H)
print(sum_)
|
[
"call.arguments.add"
] | 587,828
| 587,829
|
u723345499
|
python
|
p02785
|
n,k = map(int, input().split())
a = list(map(int,input().split()))
list_a = sorted(a, reverse = True)
if k >= n:
print(0)
else:
attack = sum(list_a[(n - k - 1):])
print(attack)
|
n,k = map(int, input().split())
a = list(map(int,input().split()))
list_a = sorted(a, reverse = True)
if k >= n:
print(0)
else:
attack = sum(list_a[k:])
print(attack)
|
[] | 587,830
| 587,831
|
u573234244
|
python
|
p02785
|
n,k = list(map(int,input().split()))
#print(n)
a = list(map(int, input().split()))
sum = 0
a.sort()
print(a)
for i in range(min(n,k)): a.pop()
#print(a)
for i in range(len(a)):
sum += a[i]
print(sum)
|
n,k = list(map(int,input().split()))
#print(n)
a = list(map(int, input().split()))
sum = 0
a.sort()
#print(a)
for i in range(min(n,k)): a.pop()
#print(a)
for i in range(len(a)):
sum += a[i]
print(sum)
|
[
"call.remove"
] | 587,842
| 587,843
|
u431484963
|
python
|
p02785
|
N,K = map(int,input().split())
H = [int(i) for i in input().split()]
if K >= N:
print(0)
else:
I = sorted(H)
a = 0
for i in range(N-K):
a += H[i]
print(a)
|
N,K = map(int,input().split())
H = [int(i) for i in input().split()]
if K >= N:
print(0)
else:
I = sorted(H)
a = 0
for i in range(N-K):
a += I[i]
print(a)
|
[
"identifier.change"
] | 587,846
| 587,847
|
u119148115
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H=sorted(H, reverse=True)
print(H)
print(sum(H[K:]))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H=sorted(H, reverse=True)
print(sum(H[K:]))
|
[
"call.remove"
] | 587,848
| 587,849
|
u151005508
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
sorted(h)
ans = 0
if len(h) == n:
for i in range(k):
try:
h.pop()
except:
pass
for x in h:
ans += x
print(ans)
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
ans = 0
if len(h) == n:
for i in range(k):
try:
h.pop()
except:
pass
for x in h:
ans += x
print(ans)
|
[
"call.remove",
"call.add"
] | 587,862
| 587,863
|
u392058721
|
python
|
p02785
|
import math
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort
if K == 0:
print(sum(H))
elif K >= N:
print(0)
else:
H = H[:-K]
print(sum(H))
|
import math
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
if K == 0:
print(sum(H))
elif K >= N:
print(0)
else:
H = H[:-K]
print(sum(H))
|
[
"call.add"
] | 587,864
| 587,865
|
u526094365
|
python
|
p02785
|
data = input().split()
n = int(data[0])
k = int(data[1])
hpstr = input().split()
hp = []
for i in range(n):
hp.append(int(hpstr[i]))
hp.sort()
print(hp)
ans = 0
for i in range(n - k):
ans += hp[i]
print(ans)
|
data = input().split()
n = int(data[0])
k = int(data[1])
hpstr = input().split()
hp = []
for i in range(n):
hp.append(int(hpstr[i]))
hp.sort()
ans = 0
for i in range(n - k):
ans += hp[i]
print(ans)
|
[
"call.remove"
] | 587,876
| 587,877
|
u860966226
|
python
|
p02785
|
n,k=map(int,input().split())
life=sorted(list(map(int,input().split())))
if n<k:
print(0)
else:
ans=sum(life[k:])
print(ans)
|
n,k=map(int,input().split())
life=sorted(list(map(int,input().split())),reverse=True)
if n<k:
print(0)
else:
ans=sum(life[k:])
print(ans)
|
[
"call.arguments.add"
] | 587,882
| 587,883
|
u281796054
|
python
|
p02785
|
#Nモンスターの数
#H[i]モンスターの体力
#K必殺技の回数
n,k= map(int,input().split())
h = list(map(int,input().split()))
h.sort
if k >= n:
print(0)
exit()
else:
for i in range(k):
h.pop()
print(sum(h))
|
n,k= map(int,input().split())
h = list(map(int,input().split()))
h.sort()
if k >= n:
print(0)
exit()
else:
for i in range(k):
h.pop()
print(sum(h))
|
[
"call.add"
] | 587,889
| 587,890
|
u391675400
|
python
|
p02785
|
N, K = map(int, input().split(' '))
H = sorted(map(int, input().split(' ')))
print(H)
if(K >= N):
print(0)
exit(0)
for j in range(K):
H[N - j - 1] = 0
print(sum(H))
|
N, K = map(int, input().split(' '))
H = sorted(map(int, input().split(' ')))
if(K >= N):
print(0)
exit(0)
for j in range(K):
H[N - j - 1] = 0
print(sum(H))
|
[
"call.remove"
] | 587,893
| 587,894
|
u895592784
|
python
|
p02785
|
N, K = map(int, input().split(' '))
H = sorted(map(int, input().split(' ')))
if(K >= N):
print(0)
exit(0)
for j in range(K):
H[K - j - 1] = 0
print(sum(H))
|
N, K = map(int, input().split(' '))
H = sorted(map(int, input().split(' ')))
if(K >= N):
print(0)
exit(0)
for j in range(K):
H[N - j - 1] = 0
print(sum(H))
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 587,895
| 587,894
|
u895592784
|
python
|
p02785
|
N,K= map(int,input().split())
H = list(map(int,input().split()))
H.sort()
s = 0
for i in range(K):
s += H[i]
print(s+K)
|
N,K= map(int,input().split())
H = list(map(int,input().split()))
H.sort()
s = 0
for i in range(N-K):
s += H[i]
print(s)
|
[
"expression.operation.binary.remove"
] | 587,898
| 587,899
|
u201387466
|
python
|
p02785
|
N,K= map(int,input().split())
H = list(map(int,input().split()))
H = sort(H)
s = 0
for i in range(N-K):
s += H[i]
print(s+K)
|
N,K= map(int,input().split())
H = list(map(int,input().split()))
H.sort()
s = 0
for i in range(N-K):
s += H[i]
print(s)
|
[
"call.arguments.change",
"expression.operation.binary.remove"
] | 587,900
| 587,899
|
u201387466
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
# print(h[:-1], h)
if k > len(h):
print(0)
else:
if k != 0:
del h[-k]
print(sum(h))
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
# h = [i for i in range(n)]
h = sorted(h)
# print(h[:-1], h)
if k > len(h):
print(0)
else:
if k != 0:
del h[-k:]
print(sum(h))
|
[] | 587,901
| 587,902
|
u514390882
|
python
|
p02785
|
N, K = map(int, input().split())
lst = list(map(int, input().split()))
lst.sort(reverse=True)
ans = 0
if N <= K:
print(N)
else:
print(sum(lst[K:])+K)
|
N, K = map(int, input().split())
lst = list(map(int, input().split()))
lst.sort(reverse=True)
ans = 0
if N <= K:
print(0)
else:
print(sum(lst[K:]))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 587,919
| 587,920
|
u556225812
|
python
|
p02785
|
n,k=map(int,input().split())
hlist = list(map(int,input().split()))
hlist.sort(reverse=True)
print(hlist)
if n<k:
k = n
for i in range(0,k):
hlist[i] = 0
print(sum(hlist))
|
n,k=map(int,input().split())
hlist = list(map(int,input().split()))
hlist.sort(reverse=True)
if n<k:
k = n
for i in range(0,k):
hlist[i] = 0
print(sum(hlist))
|
[
"call.remove"
] | 587,921
| 587,922
|
u312666261
|
python
|
p02785
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
if n<=k :
print(0)
else :
sm = 0
for i in range(n-k):
sm += l[i]
pritn(sm)
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
if n<=k :
print(0)
else :
sm = 0
for i in range(n-k):
sm += l[i]
print(sm)
|
[
"identifier.change",
"call.function.change"
] | 587,979
| 587,980
|
u771167374
|
python
|
p02785
|
n, k = map(int, input().split())
l = list(map(int, input().split())).sort()
if n<=k :
print(0)
else :
sm = 0
for i in range(n-k):
sm += l[i]
pritn(sm)
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
if n<=k :
print(0)
else :
sm = 0
for i in range(n-k):
sm += l[i]
print(sm)
|
[
"identifier.change",
"call.function.change"
] | 587,981
| 587,980
|
u771167374
|
python
|
p02785
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l = sorted(l)
if n<=k :
print(0)
else :
sm = 0
for i in range(n-k):
sm += l[i]
pritn(sm)
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
if n<=k :
print(0)
else :
sm = 0
for i in range(n-k):
sm += l[i]
print(sm)
|
[
"call.add",
"identifier.change",
"call.function.change"
] | 587,982
| 587,980
|
u771167374
|
python
|
p02785
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if k>=n:
print(n)
else:
print(k+sum(h[:n-k]))
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if k>=n:
print(0)
else:
print(sum(h[:n-k]))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 587,996
| 587,997
|
u547167033
|
python
|
p02785
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if k>=n:
print(k)
else:
print(k+sum(h[:n-k]))
|
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
if k>=n:
print(0)
else:
print(sum(h[:n-k]))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 587,998
| 587,997
|
u547167033
|
python
|
p02785
|
N = list(map(int,input().rstrip().split()))
n = N[0]
k = N[1]
h = list(map(int,input().split()))
h.sort(reverse=True)
m = 0
hit = 0
if k >= n :
m = n
else:
for i in range(k,n):
hit += h[i]
m = k + hit
print(m)
|
N = list(map(int,input().rstrip().split()))
n = N[0]
k = N[1]
h = list(map(int,input().split()))
h.sort(reverse=True)
m = 0
hit = 0
if k >= n :
m = 0
else:
for i in range(k,n):
hit += h[i]
m = hit
print(m)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.remove"
] | 588,016
| 588,017
|
u891945807
|
python
|
p02785
|
N, K = map(int, input().split())
H = sorted([int(x) for x in input().split()])[::-1]
print(sum(H[N:]))
|
N, K = map(int, input().split())
H = sorted([int(x) for x in input().split()])[::-1]
print(sum(H[K:]))
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 588,042
| 588,043
|
u655110382
|
python
|
p02785
|
from collections import deque
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
D = deque(H)
for _ in range(K):
if N == 0:
break
D.pop()
N -= 1
print(D)
|
from collections import deque
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
D = deque(H)
for _ in range(K):
if N == 0:
break
D.pop()
N -= 1
print(sum(D))
|
[
"call.arguments.add",
"call.arguments.change"
] | 588,047
| 588,048
|
u278886389
|
python
|
p02785
|
from collections import deque
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
D = deque(H)
for _ in range(K):
if N == 0:
break
D.pop()
N -= 1
print(H)
|
from collections import deque
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
D = deque(H)
for _ in range(K):
if N == 0:
break
D.pop()
N -= 1
print(sum(D))
|
[
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 588,049
| 588,048
|
u278886389
|
python
|
p02785
|
n,k=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
print(sum(H[k+1:]))
|
n,k=map(int,input().split())
H=list(map(int,input().split()))
H.sort(reverse=True)
print(sum(H[k:]))
|
[
"expression.operation.binary.remove"
] | 588,050
| 588,051
|
u210827208
|
python
|
p02785
|
kazu1 = list(map(int, input().split()))
kazu2 = list(map(int, input().split()))
n = 0
kazu2.sort(reverse=True)
kazu2[0:kazu1[1]-1] = 0
n += sum(kazu2)
print(n)
|
kazu1 = list(map(int, input().split()))
kazu2 = list(map(int, input().split()))
n = 0
kazu2.sort(reverse=True)
kazu2[:kazu1[1]] = [0]
n += sum(kazu2)
print(n)
|
[
"expression.operation.binary.remove"
] | 588,054
| 588,055
|
u300457253
|
python
|
p02785
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reversed=True)
h = h[k:]
print(sum(h))
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
h = h[k:]
print(sum(h))
|
[
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.near.change"
] | 588,056
| 588,057
|
u362560965
|
python
|
p02785
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
h = h[k:]
print(sum(h))
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
h = h[k:]
print(sum(h))
|
[
"call.arguments.keyword_argument.add"
] | 588,058
| 588,057
|
u362560965
|
python
|
p02785
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
h = h[k+1:]
print(sum(h))
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
h = h[k:]
print(sum(h))
|
[
"expression.operation.binary.remove"
] | 588,059
| 588,057
|
u362560965
|
python
|
p02785
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
h = h[k+1:]
print(sum(h))
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
h = h[k:]
print(sum(h))
|
[
"expression.operation.binary.remove"
] | 588,060
| 588,057
|
u362560965
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.