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 |
|---|---|---|---|---|---|---|---|
p02785
|
import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい
N,K,*H = map(int,read().split())
N -= K
if N <= 0:
print(0)
exit()
H.sort()
print(sum(H[:N - K + 1]))
|
import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい
N,K,*H = map(int,read().split())
N -= K
if N <= 0:
print(0)
exit()
H.sort()
print(sum(H[: N]))
|
[
"expression.operation.binary.remove"
] | 588,061
| 588,062
|
u355371431
|
python
|
p02785
|
import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい
N,K,*H = map(int,read().split())
N -= K
if N <= 0:
print(0)
exit()
H.sort()
print(sum(H[:N - K]))
|
import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい
N,K,*H = map(int,read().split())
N -= K
if N <= 0:
print(0)
exit()
H.sort()
print(sum(H[: N]))
|
[
"expression.operation.binary.remove"
] | 588,063
| 588,062
|
u355371431
|
python
|
p02785
|
n,k=map(int,input().split())
hp=list(map(int,input().split()))
hp.sort(reverse=True)
print(sum(hp[-k:]))
|
n,k=map(int,input().split())
hp=list(map(int,input().split()))
hp.sort(reverse=True)
print(sum(hp[k:]))
|
[
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 588,072
| 588,073
|
u562550538
|
python
|
p02785
|
n, k = map(int, input().split())
teki_list = [i for i in map(int, input().split())]
#敵を弱い順に並べる
teki_list.sort()
#強いやつに必殺技を使う
if k <= len(teki_list):
del teki_list[-k:]
else:
del teki_list[:]
print(sum(teki_list))
|
n, k = map(int, input().split())
teki_list = [i for i in map(int, input().split())]
#敵を弱い順に並べる
teki_list.sort()
if k != 0:
#強いやつに必殺技を使う
if k <= len(teki_list):
del teki_list[-k:]
else:
del teki_list[:]
print(sum(teki_list))
|
[
"control_flow.branch.if.add"
] | 588,082
| 588,083
|
u878239774
|
python
|
p02785
|
n, k = map(int, input().split())
H = list(map(int, input().split()))
sH = sorted(H, reverse=True)
ans = sum(sH[k:n-1:])
print(ans)
|
n, k = map(int, input().split())
H = list(map(int, input().split()))
sH = sorted(H, reverse=True)
ans = sum(sH[k::])
print(ans)
|
[
"expression.operation.binary.remove"
] | 588,084
| 588,085
|
u104005543
|
python
|
p02785
|
inp = input().split()
n,k = map(int, inp)
nums = list(input().split())
nums_list = list(map(int, nums))
kill_en_hp = 0
if len(nums_list) < k:
print(0)
else:
nums_list.sort()
nums_list_2 = nums_list[k:]
print(sum(nums_list_2u))
|
inp = input().split()
n,k = map(int, inp)
nums = list(input().split())
nums_list = list(map(int, nums))
kill_en_hp = 0
if len(nums_list) < k:
print(0)
else:
nums_list.sort(reverse=True)
nums_list_2 = nums_list[k:]
print(sum(nums_list_2))
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 588,086
| 588,087
|
u156778434
|
python
|
p02785
|
feneck = input().split()
H = input().split()
H_i = [int(h) for h in H]
N = int(feneck[0])
K = int(feneck[1])
list.sort(H_i, reverse=True)
if K < len(H):
sum = 0
H_i = H[K:]
for hp in H_i:
hp = int(hp)
sum += hp
print(sum)
else:
print(0)
|
feneck = input().split()
H = input().split()
H_i = [int(h) for h in H]
N = int(feneck[0])
K = int(feneck[1])
list.sort(H_i, reverse=True)
if K < len(H_i):
sum = 0
H_i = H_i[K:]
for hp in H_i:
hp = int(hp)
sum += hp
print(sum)
else:
print(0)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 588,090
| 588,091
|
u450292714
|
python
|
p02785
|
n, k = map(int, input().split())
print(sum(sorted((list(map(int, input().split())))[:0 if n<k else n-k])))
|
n, k = map(int, input().split())
print(sum(sorted(list(map(int, input().split())))[:0 if n<=k else n-k]))
|
[
"call.arguments.change",
"expression.operator.compare.change",
"variable_access.subscript.index.change"
] | 588,098
| 588,099
|
u337820403
|
python
|
p02785
|
n, k = map(int, input().split())
print(sum(sorted((list(map(int, input().split())))[:0 if n<=k else n-k])))
|
n, k = map(int, input().split())
print(sum(sorted(list(map(int, input().split())))[:0 if n<=k else n-k]))
|
[
"call.arguments.change"
] | 588,100
| 588,099
|
u337820403
|
python
|
p02785
|
x = [int(i) for i in input().split(" ")]
s = x[1]
m = [int(i) for i in input().split(" ")]
if s == 0:
print(sum(m))
else:
m = sorted(m)[0:-s:1]
print(m)
|
x = [int(i) for i in input().split(" ")]
s = x[1]
m = [int(i) for i in input().split(" ")]
if s == 0:
print(sum(m))
else:
m = sorted(m)[0:-s:1]
print(sum(m))
|
[
"call.arguments.add",
"call.arguments.change"
] | 588,101
| 588,102
|
u957616073
|
python
|
p02785
|
n,k=map(int,input().split())
h=[int(i) for i in input().split()]
h.sort
a=0
if n>k:
for j in range(n-k):
a+=h[j]
print(a)
else:
print(0)
|
n,k=map(int,input().split())
h=[int(i) for i in input().split()]
h.sort()
a=0
if n>k:
for j in range(n-k):
a+=h[j]
print(a)
else:
print(0)
|
[
"call.add"
] | 588,111
| 588,112
|
u629607744
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = h.sort()
if k >= n:
print(0)
else:
print(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]))
|
[
"assignment.remove"
] | 588,113
| 588,114
|
u977141657
|
python
|
p02785
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort
if N > K:
for i in range(K):
A.pop()
print(sum(A))
else:
print("0")
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
if N > K:
for i in range(K):
A.pop()
print(sum(A))
else:
print("0")
|
[
"call.add"
] | 588,117
| 588,118
|
u024422110
|
python
|
p02785
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort
if N > K:
for i in range(K):
A.pop()
print(A)
else:
print("0")
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
if N > K:
for i in range(K):
A.pop()
print(sum(A))
else:
print("0")
|
[
"call.add",
"call.arguments.change"
] | 588,119
| 588,118
|
u024422110
|
python
|
p02785
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort
if N >= K:
for i in range(K):
A.pop()
print(A)
else:
print("0")
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
if N > K:
for i in range(K):
A.pop()
print(sum(A))
else:
print("0")
|
[
"call.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 588,120
| 588,118
|
u024422110
|
python
|
p02785
|
n,k,*a=map(int,open(0).read().split())
a.sort()
a+=[0]
print(sum(a[:~k])+k)
|
n,k,*a=map(int,open(0).read().split())
a.sort()
a+=[0]
print(sum(a[:~k]))
|
[
"expression.operation.binary.remove"
] | 588,141
| 588,142
|
u670180528
|
python
|
p02785
|
N, K = map(int, input().split())
life = list(map(int, input().split()))
Nlife = sorted(life, reverse=True)
if K >= 1:
del Nlife[:K-1]
answer = sum(Nlife)
print(answer)
|
N, K = map(int, input().split())
life = list(map(int, input().split()))
Nlife = sorted(life, reverse=True)
if K >= 1:
del Nlife[:K]
answer = sum(Nlife)
print(answer)
|
[
"expression.operation.binary.remove"
] | 588,143
| 588,144
|
u966546644
|
python
|
p02785
|
import sys
def InS(): return input()
def InL(): return list(map(int, input().split()))
def InI(): return int(input())
N, K = InL()
H = InL().sort()
if K >= N:
print(0)
sys.exit()
print(sum(H[0:N-K]))
|
import sys
def InS(): return input()
def InL(): return list(map(int, input().split()))
def InI(): return int(input())
N, K = InL()
H = InL()
H.sort()
if K >= N:
print(0)
sys.exit()
else:
print(sum(H[0:N-K]))
|
[] | 588,153
| 588,154
|
u852437863
|
python
|
p02785
|
H, K = map(int, input().split())
hp = list(int, map(input().split()))
hp.sort(reverse=True)
print(sum(hp[K:]))
|
H, K = map(int, input().split())
hp = list(map(int, input().split()))
hp.sort(reverse=True)
print(sum(hp[K:]))
|
[
"call.arguments.change",
"call.arguments.add"
] | 588,159
| 588,160
|
u370721525
|
python
|
p02785
|
H, K = map(int, input().split())
hp = list(map(input().split()))
hp.sort(reverse=True)
print(sum(hp[K:]))
|
H, K = map(int, input().split())
hp = list(map(int, input().split()))
hp.sort(reverse=True)
print(sum(hp[K:]))
|
[
"call.arguments.add"
] | 588,161
| 588,160
|
u370721525
|
python
|
p02785
|
n, k = (int(z) for z in input().split())
a = [int(z) for z in input().split()]
a.sort()
sm = 0
for i in range(k,n):
sm += a[i]
print(sm)
|
n, k = (int(z) for z in input().split())
a = [int(z) for z in input().split()]
a.sort()
sm = 0
for i in range(n - k):
sm += a[i]
print(sm)
|
[
"call.arguments.change"
] | 588,188
| 588,189
|
u098510720
|
python
|
p02785
|
n,k=map(int,input().split())
m = list(map(int,input().split()))
m.sort(reverse=True)
print(k+sum(m[k:]))
|
n,k=map(int,input().split())
m = list(map(int,input().split()))
m.sort(reverse=True)
print(sum(m[k:]))
|
[
"expression.operation.binary.remove"
] | 588,208
| 588,209
|
u442581202
|
python
|
p02785
|
N, K = [int(i) for i in input().split()]
H = sorted([int(i) for i in input().split()])
if K < N and K != 0:
print(sum(H[: -K]))
elif K > N:
print(0)
else:
print(sum(H))
|
N, K = [int(i) for i in input().split()]
H = sorted([int(i) for i in input().split()])
if K < N and K!=0:
print(sum(H[:-K]))
elif K >= N:
print(0)
else:
print(sum(H))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 588,217
| 588,218
|
u840310460
|
python
|
p02785
|
N, K = [int(i) for i in input().split()]
H = sorted([int(i) for i in input().split()])
if K < N and K != 0:
print(sum(H[: -K]))
elif K > N:
print(N)
else:
print(sum(H))
|
N, K = [int(i) for i in input().split()]
H = sorted([int(i) for i in input().split()])
if K < N and K!=0:
print(sum(H[:-K]))
elif K >= N:
print(0)
else:
print(sum(H))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 588,219
| 588,218
|
u840310460
|
python
|
p02785
|
n, k = map(int, input().split())
h = sorted(list(map(int, input().split())))
if n <= k:
print(0)
exit()
print(sum(h[k:n]))
|
n, k = map(int, input().split())
h = sorted(list(map(int, input().split())), reverse=True)
if n <= k:
print(0)
exit()
print(sum(h[k:n]))
|
[
"call.arguments.add"
] | 588,230
| 588,231
|
u384793271
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
if len(h) <= k:
print(0)
else:
h.sort(reverse = True)
for i in range(0, k):
h[i] = 0
print(k)
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
if len(h) <= k:
print(0)
else:
h.sort(reverse = True)
for i in range(0, k):
h[i] = 0
print(sum(h))
|
[
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 588,261
| 588,262
|
u517870745
|
python
|
p02785
|
N,K=map(int,input().split())
H=list(map(int,input().split()))
ans=0
H.sort()
for i in range(N):
if i>=N-K:
ans+=1
else:
ans+=H[i]
print(ans)
|
N,K=map(int,input().split())
H=list(map(int,input().split()))
ans=0
H.sort()
for i in range(N):
if i>=N-K:
ans+=0
else:
ans+=H[i]
print(ans)
|
[
"literal.number.integer.change"
] | 588,265
| 588,266
|
u766393261
|
python
|
p02785
|
l, k = map(int, input().split(" "))
if k >= l:
print(0)
else:
print(sorted(map(int, input().split(" ")))[:l-k])
|
l, k = map(int, input().split(" "))
if k >= l:
print(0)
else:
print(sum(sorted(map(int, input().split(" ")))[:l-k]))
|
[
"call.arguments.add",
"call.arguments.change"
] | 588,271
| 588,272
|
u541551314
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
H.sort()
res = 0
for i in range(N - K):
res += H[i]
print(res)
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
else:
H.sort()
res = 0
for i in range(N - K):
res += H[i]
print(res)
|
[] | 588,279
| 588,280
|
u137913818
|
python
|
p02785
|
N, K = map(int, input().split())
Hs = list(map(int, input().split()))
Hs.sort(reverse=True)
if K > N:
print(sum(Hs))
else:
for i in range(K):
Hs[i] = 0
print(sum(Hs))
|
N, K = map(int, input().split())
Hs = list(map(int, input().split()))
Hs.sort(reverse=True)
if K > N:
print(0)
else:
for i in range(K):
Hs[i] = 0
print(sum(Hs))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 588,314
| 588,315
|
u157874153
|
python
|
p02785
|
h,n = map(int,input().split())
g = input().split()
G = sorted([int(j) for j in g])
del G[-n::]
print(sum(G))
|
h,n = map(int,input().split())
g = input().split()
G = sorted([int(j) for j in g])
if n != 0:
del G[-n::]
print(sum(G))
|
[
"control_flow.branch.if.add"
] | 588,316
| 588,317
|
u424012002
|
python
|
p02785
|
def main():
n, k = [int(i) for i in input().split()]
num = [int(i) for i in input().split()]
if k >= n:
return 0
else:
num = sorted(num)
return sum(num[:-k])
print(main())
|
def main():
n, k = [int(i) for i in input().split()]
num = [int(i) for i in input().split()]
if k >= n:
return 0
else:
num = sorted(num)
return sum(num[0:n-k])
print(main())
|
[
"call.arguments.change",
"function.return_value.change"
] | 588,320
| 588,321
|
u735335967
|
python
|
p02785
|
def main():
n, k = [int(i) for i in input().split()]
num = [int(i) for i in input().split()]
if k >= n:
return 0
else:
l = sorted(num)
return sum(num[:-k])
print(main())
|
def main():
n, k = [int(i) for i in input().split()]
num = [int(i) for i in input().split()]
if k >= n:
return 0
else:
num = sorted(num)
return sum(num[0:n-k])
print(main())
|
[
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"function.return_value.change"
] | 588,322
| 588,321
|
u735335967
|
python
|
p02785
|
n, k = map(int, input().split()) ###n:モンスターの数，k:必殺技の回数
h=sorted(list(map(int,input().split()))) ###h:モンスターの体力
if n<=k:
print(0)
elif k==0:
b=sum(h)
print(b)
else:
a=sum(h[:k+1])
print(a)
|
n, k = map(int, input().split()) ###n:モンスターの数，k:必殺技の回数
h=sorted(list(map(int,input().split()))) ###h:モンスターの体力
if n<=k:
print(0)
elif k==0:
b=sum(h)
print(b)
else:
a=sum(h[:-k])
print(a)
|
[
"expression.operation.unary.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 588,342
| 588,343
|
u477650749
|
python
|
p02785
|
N, K = map(int, input().split())
H = map(int, input().split())
H.sort(reverse=True)
if K >= N:
print(0)
else:
print(sum(H[K:]))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort(reverse=True)
if K >= N:
print(0)
else:
print(sum(H[K:]))
|
[
"call.add",
"call.arguments.change"
] | 588,365
| 588,366
|
u501265339
|
python
|
p02785
|
N, K = map(int, input().split())
H = map(int, input().split())
H.sorted(reverse=True)
if K >= N:
print(0)
else:
print(sum(H[K:]))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort(reverse=True)
if K >= N:
print(0)
else:
print(sum(H[K:]))
|
[
"call.add",
"call.arguments.change",
"identifier.change"
] | 588,367
| 588,366
|
u501265339
|
python
|
p02785
|
N, K = map(int, input().split())
sum(sorted(map(int, input().split()), reverse=True)[K:])
|
N, K = map(int, input().split())
print(sum(sorted(map(int, input().split()), reverse=True)[K:]))
|
[
"call.add",
"call.arguments.change"
] | 588,372
| 588,373
|
u404660239
|
python
|
p02785
|
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, H: "List[int]"):
H.reverse()
return sum(h for h in H[K:])
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
H = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
print(solve(N, K, H))
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, H: "List[int]"):
H.sort()
H.reverse()
return sum(h for h in H[K:])
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
H = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
print(solve(N, K, H))
if __name__ == '__main__':
main()
|
[
"call.add"
] | 588,374
| 588,375
|
u610801172
|
python
|
p02785
|
import math
EnemyCount, slayeCount = map(int, input().split())
enemyHealths = list(map(int, input().split(" "))).sort()
if EnemyCount < slayeCount:
slayeCount = EnemyCount
for _ in range(slayeCount):
del enemyHealths[-1]
print(sum(enemyHealths))
|
import math
EnemyCount, slayeCount = map(int, input().split())
enemyHealths = list(map(int, input().split(" ")))
enemyHealths.sort()
if EnemyCount < slayeCount:
slayeCount = EnemyCount
for _ in range(slayeCount):
del enemyHealths[-1]
print(sum(enemyHealths))
|
[] | 588,380
| 588,381
|
u949802245
|
python
|
p02785
|
import math
EnemyCount, slayeCount = map(int, input().split())
enemyHealths = list(map(int, input().split(" ")))
if EnemyCount < slayeCount:
slayeCount = EnemyCount
for _ in range(slayeCount):
del enemyHealths[-1]
print(sum(enemyHealths))
|
import math
EnemyCount, slayeCount = map(int, input().split())
enemyHealths = list(map(int, input().split(" ")))
enemyHealths.sort()
if EnemyCount < slayeCount:
slayeCount = EnemyCount
for _ in range(slayeCount):
del enemyHealths[-1]
print(sum(enemyHealths))
|
[
"call.add"
] | 588,382
| 588,381
|
u949802245
|
python
|
p02785
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
for i in range(k):
h[i] = 0
print(sum(h))
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
for i in range(min(n,k)):
h[i] = 0
print(sum(h))
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 588,385
| 588,386
|
u928784113
|
python
|
p02785
|
N, K = [int(i) for i in input().split()]
H = [int(i) for i in input().split()]
sorted_H = sorted(H)
num = np.maximum(0, N-K)
answer = sum(sorted_H[:num])
print(answer)
|
import numpy as np
N, K = [int(i) for i in input().split()]
H = [int(i) for i in input().split()]
sorted_H = sorted(H)
num = np.maximum(0, N-K)
answer = sum(sorted_H[:num])
print(answer)
|
[] | 588,392
| 588,393
|
u998169143
|
python
|
p02785
|
eneNum, spNum = map(int, input().split())
eneHp = map(int, input().split())
eneHpList = list(eneHp)
# TLE
#count = 0
#for i in range(spNum):
# if len(eneHpList) > 0:
# maxEneHp = max(eneHpList)
# eneHpList.remove(maxEneHp)
# new method
eneHpList.reverse()
del eneHpList[0:min([spNum, len(eneHpList)])]
count = sum(eneHpList)
print("{}".format(count))
|
eneNum, spNum = map(int, input().split())
eneHp = map(int, input().split())
eneHpList = list(eneHp)
# TLE
#count = 0
#for i in range(spNum):
# if len(eneHpList) > 0:
# maxEneHp = max(eneHpList)
# eneHpList.remove(maxEneHp)
# new method
eneHpList.sort()
eneHpList.reverse()
del eneHpList[0:min([spNum, len(eneHpList)])]
count = sum(eneHpList)
print("{}".format(count))
|
[
"call.add"
] | 588,409
| 588,410
|
u815931251
|
python
|
p02785
|
'''N, K = map(int, input().split())
H = list(map(int, input().split()))
for i in range(K):
if len(H)!=0:
H.remove(max(H))
#print(H)
else:
#print(0)
break
print(sum(H))'''
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
print(sum(H[K+1:]))
|
'''N, K = map(int, input().split())
H = list(map(int, input().split()))
for i in range(K):
if len(H)!=0:
H.remove(max(H))
#print(H)
else:
#print(0)
break
print(sum(H))'''
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,427
| 588,428
|
u038408819
|
python
|
p02785
|
H, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
ans = 0
for i in range( N - K ):
ans += A[i]
print(ans)
|
H, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
ans = 0
for i in range( H - K ):
ans += A[i]
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 588,462
| 588,463
|
u779728630
|
python
|
p02785
|
# coding: utf-8
# Your code here!
n, k = map(int, input().split())
hs = list(map(int, input().split()))
hs.sort()
if (n <= k):
print(0)
else:
print(sum(hs[k:]))
|
n, k = map(int, input().split())
hs = list(map(int, input().split()))
hs.sort(reverse=True)
if (n <= k):
print(0)
else:
print(sum(hs[k:]))
|
[
"call.arguments.keyword_argument.add"
] | 588,471
| 588,472
|
u574437765
|
python
|
p02785
|
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
for i in range(0,K):
H.pop()
print(sum(H))
|
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
for i in range(0,K):
if H:
H.pop()
print(sum(H))
|
[
"control_flow.branch.if.add"
] | 588,485
| 588,486
|
u780147002
|
python
|
p02785
|
N, K = map(int,input().split())
N_hp = list(map(int,input().split()))
N_hp.sort(reverse=True)
del N_hp[:K]
sum_turn = sum(N_hp)
print(K+sum_turn)
|
N, K = map(int,input().split())
N_hp = list(map(int,input().split()))
N_hp.sort(reverse=True)
del N_hp[:K]
sum_turn = sum(N_hp)
print(sum_turn)
|
[
"expression.operation.binary.remove"
] | 588,495
| 588,496
|
u266389451
|
python
|
p02785
|
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
ans = K
for i in range(K):
H.pop()
ans += sum(H)
print(ans)
|
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
ans = 0
for i in range(min(K,N)):
H.pop()
ans += sum(H)
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.add",
"call.arguments.add"
] | 588,507
| 588,508
|
u557494880
|
python
|
p02785
|
# coding: utf-8
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
if n <= k:
print(n)
else:
print(sum(h[0: n - k]))
|
# coding: utf-8
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
if n <= k:
print(0)
else:
print(sum(h[0: n - k]))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 588,519
| 588,520
|
u164678731
|
python
|
p02785
|
# coding: utf-8
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
if n <= k:
print(n)
else:
print(sum(h[0: n - k]) + k)
|
# coding: utf-8
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
if n <= k:
print(0)
else:
print(sum(h[0: n - k]))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 588,521
| 588,520
|
u164678731
|
python
|
p02785
|
a, b=map(int,input().split())
l=list(map(int,input().split()))
if a<b:
print(0)
elif a>b:
l.sort(reverse=True)
n=l[b:]
s=sum(n)
print(s)
|
a, b=map(int,input().split())
l=list(map(int,input().split()))
if a<=b:
print(0)
elif a>b:
l.sort(reverse=True)
n=l[b:]
s=sum(n)
print(s)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 588,537
| 588,538
|
u711626986
|
python
|
p02785
|
a, b=map(int,input().split())
l=list(map(int,input().split()))
if a<b:
print(0)
elif a>b:
l.sort()
n=l[b:]
s=sum(n)
print(s)
|
a, b=map(int,input().split())
l=list(map(int,input().split()))
if a<=b:
print(0)
elif a>b:
l.sort(reverse=True)
n=l[b:]
s=sum(n)
print(s)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 588,539
| 588,538
|
u711626986
|
python
|
p02785
|
n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
h.sort(reverse=True)
if(len(h) <= k):
print("0")
else:
print(sum(h,k))
|
n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
h.sort(reverse=True)
if(len(h) <= k):
print("0")
else:
print(sum(h[k:]))
|
[
"call.arguments.change",
"io.output.change"
] | 588,540
| 588,541
|
u130587994
|
python
|
p02785
|
N, K = map(int, input().split(" "))
H = list(map(int, input().split(" ")))
if N <= K:
print(0)
else:
if K == 0:
c = sum(H)
else:
c = sum(H[:-K])
print(c)
|
N, K = map(int, input().split(" "))
H = sorted(list(map(int, input().split(" "))))
if N <= K:
print(0)
else:
if K == 0:
c = sum(H)
else:
c = sum(H[:-K])
print(c)
|
[
"call.add",
"call.arguments.change"
] | 588,563
| 588,564
|
u665224938
|
python
|
p02785
|
N, K = map(int, input().split(" "))
H = list(map(int, input().split(" ")))
if N <= K:
print(0)
else:
if K == 0:
c = sum(H)
else:
c = sum(H[:-K])
print(c)
|
N, K = map(int, input().split(" "))
H = sorted(list(map(int, input().split(" "))))
if N <= K:
print(0)
else:
if K == 0:
c = sum(H)
else:
c = sum(H[:-K])
print(c)
|
[
"call.add",
"call.arguments.change"
] | 588,565
| 588,564
|
u665224938
|
python
|
p02785
|
[n,k]=[int(x) for x in input().split()]
h=[int(x) for x in input().split()]
h.sort()
if n<=k:
print("0")
else:
print(str(sum(h[:-k])))
|
[n,k]=[int(x) for x in input().split()]
h=[int(x) for x in input().split()]
h.sort()
if n<=k:
print("0")
else:
print(str(sum(h[:len(h)-k])))
|
[
"call.add"
] | 588,590
| 588,591
|
u013956357
|
python
|
p02785
|
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in input().split()]
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def NI(n):
return [int(input()) for i in range(n)]
def NI_(n):
return [int(input())-1 for i in range(n)]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def LtoS(ls):
return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
org_inp=[]
g=[[] for i in range(n)]
for i in range(E):
inp=LI()
org_inp.append(inp)
if index==0:
inp[0]-=1
inp[1]-=1
if len(inp)==2:
a,b=inp
g[a].append(b)
if not Directed:
g[b].append(a)
elif len(inp)==3:
a,b,c=inp
aa=(inp[0],inp[2])
bb=(inp[1],inp[2])
g[a].append(bb)
if not Directed:
g[b].append(aa)
return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0}):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
mp=[1]*(w+2)
found={}
for i in range(h):
s=input()
for char in search:
if char in s:
found[char]=((i+1)*(w+2)+s.index(char)+1)
mp_def[char]=mp_def[replacement_of_found]
mp+=[1]+[mp_def[j] for j in s]+[1]
mp+=[1]*(w+2)
return h+2,w+2,mp,found
def bit_combination(k,n=2):
rt=[]
for tb in range(n**k):
s=[tb//(n**bt)%n for bt in range(k)]
rt+=[s]
return rt
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
def ran_input():
import random
n=random.randint(4,16)
rmin,rmax=1,10
a=[random.randint(rmin,rmax) for _ in range(n)]
return n,a
show_flg=False
show_flg=True
ans=0
n,k=LI()
h=sorted(LI())
ans=sum(h[:n-k])
print(ans)
|
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in input().split()]
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def NI(n):
return [int(input()) for i in range(n)]
def NI_(n):
return [int(input())-1 for i in range(n)]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def LtoS(ls):
return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
org_inp=[]
g=[[] for i in range(n)]
for i in range(E):
inp=LI()
org_inp.append(inp)
if index==0:
inp[0]-=1
inp[1]-=1
if len(inp)==2:
a,b=inp
g[a].append(b)
if not Directed:
g[b].append(a)
elif len(inp)==3:
a,b,c=inp
aa=(inp[0],inp[2])
bb=(inp[1],inp[2])
g[a].append(bb)
if not Directed:
g[b].append(aa)
return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0}):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
mp=[1]*(w+2)
found={}
for i in range(h):
s=input()
for char in search:
if char in s:
found[char]=((i+1)*(w+2)+s.index(char)+1)
mp_def[char]=mp_def[replacement_of_found]
mp+=[1]+[mp_def[j] for j in s]+[1]
mp+=[1]*(w+2)
return h+2,w+2,mp,found
def bit_combination(k,n=2):
rt=[]
for tb in range(n**k):
s=[tb//(n**bt)%n for bt in range(k)]
rt+=[s]
return rt
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
def ran_input():
import random
n=random.randint(4,16)
rmin,rmax=1,10
a=[random.randint(rmin,rmax) for _ in range(n)]
return n,a
show_flg=False
show_flg=True
ans=0
n,k=LI()
h=sorted(LI())
ans=sum(h[:max(0,n-k)])
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 588,613
| 588,614
|
u623819879
|
python
|
p02785
|
import math
N,K = map(int,input().split())
K = min(N,K)
data = list(map(int,input().split()))
data.sort()
total = sum( data[0:N-K] )
print(data)
print(total)
|
import math
N,K = map(int,input().split())
K = min(N,K)
data = list(map(int,input().split()))
data.sort()
total = sum( data[0:N-K] )
print(total)
|
[
"call.remove"
] | 588,623
| 588,624
|
u112952458
|
python
|
p02785
|
n, k = [int(x) for x in input().split()]
h_n = list(map(int, input().split()))
if n <= k:
print("0")
s_n = sorted(h_n)
print(sum(s_n[:n - k]))
|
import math
n, k = [int(x) for x in input().split()]
h_n = list(map(int, input().split()))
if n <= k:
print("0")
else:
s_n = sorted(h_n)
print(sum(s_n[:n-k]))
|
[] | 588,629
| 588,630
|
u706330549
|
python
|
p02785
|
n, k = [int(x) for x in input().split()]
h_n = list(map(int, input().split()))
if n < k:
print("0")
s_n = sorted(h_n)
print(sum(s_n[:n - k]))
|
import math
n, k = [int(x) for x in input().split()]
h_n = list(map(int, input().split()))
if n <= k:
print("0")
else:
s_n = sorted(h_n)
print(sum(s_n[:n-k]))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 588,631
| 588,630
|
u706330549
|
python
|
p02785
|
n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
if n <= k:
print(0)
else:
print(sum(H[:k+1]))
|
n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
if n <= k:
print(0)
else:
print(sum(H[:n-k]))
|
[
"expression.operation.binary.remove"
] | 588,632
| 588,633
|
u754022296
|
python
|
p02785
|
n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
if n <= k:
print(0)
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]))
|
[
"expression.operation.binary.add"
] | 588,634
| 588,633
|
u754022296
|
python
|
p02785
|
#n = int(input())
n,k = map(int,input().split())
h_L = list(map(int,input().split()))
h_L.sort(reverse=True)
#print(h_L)
if k ==0:
print(sum(h_L))
else:
print(sum(h_L[k+1:]))
|
#n = int(input())
n,k = map(int,input().split())
h_L = list(map(int,input().split()))
h_L.sort(reverse=True)
#print(h_L)
if k ==0:
print(sum(h_L))
else:
print(sum(h_L[k:]))
|
[
"expression.operation.binary.remove"
] | 588,652
| 588,653
|
u625255205
|
python
|
p02785
|
#n = int(input())
n,k = map(int,input().split())
h_L = list(map(int,input().split()))
h_L.sort()
if k ==0:
print(sum(h_L))
else:
print(sum(h_L[k+1:]))
|
#n = int(input())
n,k = map(int,input().split())
h_L = list(map(int,input().split()))
h_L.sort(reverse=True)
#print(h_L)
if k ==0:
print(sum(h_L))
else:
print(sum(h_L[k:]))
|
[
"expression.operation.binary.remove"
] | 588,654
| 588,653
|
u625255205
|
python
|
p02785
|
n,k = map(int,input().split())
h = list(map(input().split()))
h.sort()
ans = int(0)
for i in range(len(h) - k):
ans += int(h[i])
print(ans)
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()
ans = int(0)
for i in range(len(h) - k):
ans += int(h[i])
print(ans)
|
[
"call.arguments.add"
] | 588,659
| 588,660
|
u676258045
|
python
|
p02785
|
n,k = map(int,input().split())
h = list(input().split())
h.sort()
ans = int(0)
for i in range(len(h) - k):
ans += int(h[i])
print(ans)
|
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()
ans = int(0)
for i in range(len(h) - k):
ans += int(h[i])
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 588,661
| 588,660
|
u676258045
|
python
|
p02785
|
# coding: utf-8
bodies_count = list(map(int,input().split()))
enemy_life = list(map(int,input().split()))
if bodies_count[1] == 0:
print(sum(enemy_life))
else:
enemy_life.sort(reverse=True)
if bodies_count[1] == 1:
del enemy_life[0]
else:
a = bodies_count[1]-1
del enemy_life[0:a]
if enemy_life != []:
print(sum(enemy_life))
else:
print(0)
# for i in range(bodies_count[1]):
# if enemy_life == []:
# print(count)
# break
# else:
# enemy_life.sort()
# print(enemy_life)
# enemy_life.pop(enemy_life.index(max(enemy_life)))
|
# coding: utf-8
bodies_count = list(map(int,input().split()))
enemy_life = list(map(int,input().split()))
if bodies_count[1] == 0:
print(sum(enemy_life))
else:
enemy_life.sort(reverse=True)
if bodies_count[1] == 1:
del enemy_life[0]
else:
a = bodies_count[1]
del enemy_life[0:a]
if enemy_life != []:
print(sum(enemy_life))
else:
print(0)
# for i in range(bodies_count[1]):
# if enemy_life == []:
# print(count)
# break
# else:
# enemy_life.sort()
# print(enemy_life)
# enemy_life.pop(enemy_life.index(max(enemy_life)))
|
[
"expression.operation.binary.remove"
] | 588,666
| 588,667
|
u265475910
|
python
|
p02785
|
n, k = list(map(int, input().rstrip().split()))
h = list(map(int, input().rstrip().split()))
h.sort()
print(sum(h[:min(0, n-k)]))
|
n, k = list(map(int, input().rstrip().split()))
h = list(map(int, input().rstrip().split()))
h.sort()
print(sum(h[:max(0, n-k)]))
|
[
"misc.opposites",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 588,668
| 588,669
|
u086127549
|
python
|
p02785
|
n,k,*h=map(int,open(0).read().split())
print(sum(sorted(h)[:min(n,n-k)]))
|
n,k,*h=map(int,open(0).read().split())
print(sum(sorted(h)[:n-min(n,k)]))
|
[
"expression.operation.binary.remove"
] | 588,670
| 588,671
|
u729133443
|
python
|
p02785
|
n,k,*h=map(int,open(0).read().split())
print(sum(sorted(h)[:n-k]))
|
n,k,*h=map(int,open(0).read().split())
print(sum(sorted(h)[:n-min(n,k)]))
|
[
"call.add",
"call.arguments.change"
] | 588,672
| 588,671
|
u729133443
|
python
|
p02785
|
N , K = map(int, input().split())
H = [int(i) for i in input().split()]
if N <= K:
print(0)
elif K == 0:
print(sum(H))
else:
H.reverse()
print(sum(H[K:N]))
|
N , K = map(int, input().split())
H = [int(i) for i in input().split()]
if N <= K:
print(0)
elif K == 0:
print(sum(H))
else:
H.sort()
H.reverse()
print(sum(H[K:N]))
|
[
"call.add"
] | 588,673
| 588,674
|
u094948011
|
python
|
p02785
|
N, K=map(int,input().split())
arr = list(map(int,input().split()))
if(K>= N):
print('0')
else:
if (K > 0):
# for i in range(K):
# arr.remove(max(arr))
new_arr = sorted(arr)
ans = new_arr[:-K]
print(sum(ans))
|
N, K=map(int,input().split())
arr = list(map(int,input().split()))
if(K>= N):
print('0')
else:
if (K > 0):
new_arr = sorted(arr)
arr = new_arr[:-K]
print(sum(arr))
|
[
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 588,686
| 588,687
|
u649513889
|
python
|
p02785
|
import math
n,k=map(int,input().split())
enemys = list(map(int,input().split()))
enemys.sort(reverse=True)
count = 0
for e in enemys:
if(k > 0):
count += 1
k -= 1
else:
count += e
print(count)
|
import math
n,k=map(int,input().split())
enemys = list(map(int,input().split()))
enemys.sort(reverse=True)
count = 0
for e in enemys:
if(k > 0):
k -= 1
else:
count += e
print(count)
|
[] | 588,698
| 588,699
|
u609502714
|
python
|
p02785
|
import sys
use_clipboard=True
bbn=1000000007
#+++++
def main():
n,k = map(int, input().split())
hl=list(map(int, input().split()))
if k > 0:
ret = sum(hl[:-k])
else:
ret=sum(hl)
print(ret)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
class input_clipboard:
def __init__(self,s):
self.input_l=s.splitlines()
self.ii=0
def input(self):
ret = self.input_l[self.ii]
self.ii+=1
return ret
if __name__ == "__main__":
if sys.platform =='ios':
if use_clipboard:
import clipboard
input_text=clipboard.get()
ic=input_clipboard(input_text)
input = lambda : ic.input()
else:
sys.stdin=open('inputFile.txt')
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
|
import sys
use_clipboard=False
bbn=1000000007
#+++++
def main():
n,k = map(int, input().split())
hl=list(map(int, input().split()))
hl.sort()
#pa(hl)
if k > 0:
ret = sum(hl[:-k])
else:
ret=sum(hl)
print(ret)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
class input_clipboard:
def __init__(self,s):
self.input_l=s.splitlines()
self.ii=0
def input(self):
ret = self.input_l[self.ii]
self.ii+=1
return ret
if __name__ == "__main__":
if sys.platform =='ios':
if use_clipboard:
import clipboard
input_text=clipboard.get()
ic=input_clipboard(input_text)
input = lambda : ic.input()
else:
sys.stdin=open('inputFile.txt')
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
|
[
"misc.opposites",
"assignment.value.change",
"call.add"
] | 588,702
| 588,703
|
u505830998
|
python
|
p02785
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
listsort=sorted(A, reverse=True)
print(listsort)
del listsort[0:K]
print(sum(listsort))
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
listsort=sorted(A, reverse=True)
del listsort[0:K]
print(sum(listsort))
|
[
"call.remove"
] | 588,714
| 588,715
|
u444238096
|
python
|
p02785
|
n, k = map(int, input().split())
if k >= n:
print(n)
exit(0)
h = sorted(map(int, input().split()))
print(sum(h[0:n-k]) + k)
|
n, k = map(int, input().split())
if k >= n:
print(0)
exit(0)
h = sorted(map(int, input().split()))
print(sum(h[0:n-k]))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 588,716
| 588,717
|
u369105927
|
python
|
p02785
|
n, a = map(int, input().strip().split())
if n < a:
print(0)
aaa = list(map(int, input().strip().split()))
aaa = sorted(aaa, reverse=True)
h = 0
for i in range(a, n):
h += aaa[i]
print(h)
|
n, a = map(int, input().strip().split())
if n <= a:
print(0)
else:
aaa = list(map(int, input().strip().split()))
aaa = sorted(aaa, reverse=True)
h = 0
for i in range(a, n):
h += aaa[i]
print(h)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 588,739
| 588,740
|
u071513718
|
python
|
p02785
|
x = input().split(" ")
n = int(x[0])
k = int(x[1])
h = list(map(int,input().split(" ")))
h.sort(reverse=True)
print(h)
ans = 0
if k >= n:
print(0)
else:
for i in range(k,n):
ans += h[i]
print(ans)
|
x = input().split(" ")
n = int(x[0])
k = int(x[1])
h = list(map(int,input().split(" ")))
h.sort(reverse=True)
ans = 0
if k >= n:
print(0)
else:
for i in range(k,n):
ans += h[i]
print(ans)
|
[
"call.remove"
] | 588,745
| 588,746
|
u700929101
|
python
|
p02785
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
print(sum(h[k:]), h)
|
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
print(sum(h[k:]))
|
[
"call.arguments.change"
] | 588,751
| 588,752
|
u867826040
|
python
|
p02785
|
# -*- coding: utf-8 -*-
n, k = map(int, input().split())
H = sorted([int(i) for i in input().split()], reverse = True)
if k == 0:
print(sum(H))
elif k >= n:
print(0)
else:
print(sum(H[(n-k-1):]))
|
# -*- coding: utf-8 -*-
n, k = map(int, input().split())
H = sorted([int(i) for i in input().split()], reverse=True)
if k == 0:
print(sum(H))
elif k >= n:
print(0)
else:
print(sum(H[k:]))
|
[] | 588,761
| 588,762
|
u214245159
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
if K >= N:
print(N)
else:
print(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"
] | 588,772
| 588,773
|
u290886932
|
python
|
p02785
|
import sys
import math
from collections import deque
input = sys.stdin.readline
N, K = map(int,input().split())
H = list(map(int,input().split()))
ans = 0
for i in range(N-K):
ans += H[i]
print(ans)
|
import sys
import math
from collections import deque
input = sys.stdin.readline
N, K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
ans = 0
for i in range(N-K):
ans += H[i]
print(ans)
|
[
"call.add"
] | 588,776
| 588,777
|
u385244248
|
python
|
p02785
|
import sys
import math
from collections import deque
input = sys.stdin.readline
N, K = map(int,input().split())
H = deque(map(int,input().split()))
ans = 0
for i in range(N-K):
ans += H[i]
print(ans)
|
import sys
import math
from collections import deque
input = sys.stdin.readline
N, K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
ans = 0
for i in range(N-K):
ans += H[i]
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.add"
] | 588,778
| 588,777
|
u385244248
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
sorted(H)
if K >= len(H):
print(0)
else:
print(sum(H[0:len(H) - K]))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
if K >= len(H):
print(0)
else:
print(sum(H[0:len(H) - K]))
|
[
"call.remove",
"call.add"
] | 588,789
| 588,790
|
u002539468
|
python
|
p02785
|
inp = input().rstrip().split(" ")
N = int(inp[0])
K = int(inp[1])
inp = input().rstrip().split(" ")
HP = [0 for i in range(N)]
for i in range(N):
HP[i] = int(inp[i])
HP.reverse()
ans = 0
for i in range(N):
if i >= K:
ans += HP[i]
print(ans)
|
inp = input().rstrip().split(" ")
N = int(inp[0])
K = int(inp[1])
inp = input().rstrip().split(" ")
HP = [0 for i in range(N)]
for i in range(N):
HP[i] = int(inp[i])
HP.sort()
HP.reverse()
ans = 0
for i in range(N):
if i >= K:
ans += HP[i]
print(ans)
|
[
"call.add"
] | 588,843
| 588,844
|
u017050982
|
python
|
p02785
|
N=list(map(int,input().split()))
H=list(map(int,input().split()))
H=sorted(H,reverse=True)
if N[1]>=len(H):
print(len(H))
else:
del(H[0:N[1]])
print(sum(H))
|
N=list(map(int,input().split()))
H=list(map(int,input().split()))
H=sorted(H,reverse=True)
if N[1]>=len(H):
print(0)
else:
del(H[0:N[1]])
print(sum(H))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 588,855
| 588,856
|
u065774356
|
python
|
p02785
|
from heapq import heapify, heappop
from math import ceil
N, K = map(int, input().split())
H = list(map(int, input().split()))
# N=3
# K=0
# H=[1000000000,1000000000,1000000000]
Hminus = list(map(lambda x: x*(-1), H))
# print(type(Hminus))
heapify(Hminus)
# print(Hminus)
if K > len(H):
print(len(H))
else:
for _ in range(K):
heappop(Hminus)
print(sum(Hminus)*(-1))
|
from heapq import heapify, heappop
from math import ceil
N, K = map(int, input().split())
H = list(map(int, input().split()))
# N=8
# K=9
# H=[7, 9, 3, 2, 3, 8, 4, 6]
Hminus = list(map(lambda x: x*(-1), H))
# print(type(Hminus))
heapify(Hminus)
# print(Hminus)
if K > len(H):
print(0)
else:
for _ in range(K):
heappop(Hminus)
print(sum(Hminus)*(-1))
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 588,863
| 588,864
|
u609258687
|
python
|
p02785
|
# https://atcoder.jp/contests/abc153/tasks/abc153_c
import numpy as np
N, K = map(int, input().split())
H = np.array(list(map(int, input().split())), dtype='int64')
H.sort()
# print('H', H)
if N <= K:
print(0)
exit()
if K == 0:
print(H.sum())
exit()
subset = H[:K + 1]
# print(subset)
print(subset.sum())
|
# https://atcoder.jp/contests/abc153/tasks/abc153_c
import numpy as np
N, K = map(int, input().split())
H = np.array(list(map(int, input().split())), dtype='int64')
H.sort()
# print('H', H)
if N <= K:
print(0)
exit()
if K == 0:
print(H.sum())
exit()
subset = H[:-K]
# print(subset)
print(subset.sum())
|
[
"expression.operation.unary.add",
"expression.operation.binary.remove"
] | 588,867
| 588,868
|
u903005414
|
python
|
p02785
|
h, k = map(int, input().split())
lis = list(map(int, input().split()))
if n >= k:
lis.sort(reverse=True)
lis = lis[k:]
else:
lis = []
print(sum(lis))
|
h, k = map(int, input().split())
lis = list(map(int, input().split()))
if h >= k:
lis.sort(reverse=True)
lis = lis[k:]
else:
lis = []
print(sum(lis))
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 588,881
| 588,882
|
u057996804
|
python
|
p02785
|
n,k = map(int,input().split())
d = input().split()
d = [int(i) for i in d]
d.reverse()
del d[0:k]
print(sum(d))
|
n,k = map(int,input().split())
d = input().split()
d = [int(i) for i in d]
d.sort()
d.reverse()
del d[0:k]
print(sum(d))
|
[
"call.add"
] | 588,888
| 588,889
|
u159217536
|
python
|
p02785
|
N,K = map(int, input().split())
H = list(map(int, input().split()))
H.sort(reverse=True)
if N <= K:
print(0)
else:
del l[0:K]
print(sum(H))
|
N,K = map(int, input().split())
H = list(map(int, input().split()))
H.sort(reverse=True)
if N <= K:
print(0)
else:
del H[0:K]
print(sum(H))
|
[
"identifier.change"
] | 588,890
| 588,891
|
u703969935
|
python
|
p02785
|
i = list(map(int, input().split()))
j= list(map(int, input().split()))
x=sorted(j, reverse=True)
z=0
if i[1]>=len(j):
print(0)
else:
for a in range(i[0],len(x)):
z+=x[a]
print(z)
|
i = list(map(int, input().split()))
j= list(map(int, input().split()))
x=sorted(j, reverse=True)
z=0
if i[1]>=len(j):
print(0)
else:
for a in range(i[1],len(x)):
z+=x[a]
print(z)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 588,892
| 588,893
|
u185405877
|
python
|
p02785
|
n, k = map(int, input().split(' '))
nums = list(map(int, input().split(' ')))
nums.sort(reverse=True)
if k >= n:
print(0)
else:
if k > 0:
nums = nums[:k]
print(sum(nums))
|
n, k = map(int, input().split(' '))
nums = list(map(int, input().split(' ')))
nums.sort(reverse=True)
if k >= n:
print(0)
else:
if k > 0:
del nums[:k]
print(sum(nums))
|
[] | 588,898
| 588,899
|
u221580805
|
python
|
p02785
|
n,k=map(int,input().split())
H=list(map(int,input().split()))
H.sort()
H.reverse()
print(H)
del H[:k]
a=sum(H)
print(a)
|
n,k=map(int,input().split())
H=list(map(int,input().split()))
H.sort()
H.reverse()
del H[:k]
a=sum(H)
print(a)
|
[
"call.remove"
] | 588,906
| 588,907
|
u343977188
|
python
|
p02785
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
if K != 0:
H = H[:-K]
print(sum(H))
|
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
if K != 0:
H = H[:-K]
print(sum(H))
|
[
"call.add"
] | 588,931
| 588,932
|
u482789362
|
python
|
p02785
|
n,k = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted(arr)
arr[:min(n,k)] = [0]*min(n,k)
print(sum(arr))
|
n,k = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted(arr,reverse=True)
arr[:min(n,k)] = [0]*min(n,k)
print(sum(arr))
|
[
"call.arguments.add"
] | 588,942
| 588,943
|
u078181689
|
python
|
p02785
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
k = min(k,len(h))
del h[:k]
print(sum(h))
|
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
k = min(k,len(h))
del h[:k]
print(sum(h))
|
[
"call.arguments.keyword_argument.add"
] | 588,946
| 588,947
|
u072606168
|
python
|
p02785
|
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:N])
print(sum_a)
|
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:])
print(sum_a)
|
[
"call.arguments.change"
] | 588,955
| 588,956
|
u796708718
|
python
|
p02785
|
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=Ture)
sum_a = sum(HP[K:N])
print(sum_a)
|
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:])
print(sum_a)
|
[
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 588,957
| 588,956
|
u796708718
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.