message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 450 109k | cluster float64 2 2 | __index_level_0__ int64 900 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n warriors in a row. The power of the i-th warrior is a_i. All powers are pairwise distinct.
You have two types of spells which you may cast:
1. Fireball: you spend x mana and des... | instruction | 0 | 81,009 | 2 | 162,018 |
No | output | 1 | 81,009 | 2 | 162,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n warriors in a row. The power of the i-th warrior is a_i. All powers are pairwise distinct.
You have two types of spells which you may cast:
1. Fireball: you spend x mana and des... | instruction | 0 | 81,010 | 2 | 162,020 |
No | output | 1 | 81,010 | 2 | 162,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n warriors in a row. The power of the i-th warrior is a_i. All powers are pairwise distinct.
You have two types of spells which you may cast:
1. Fireball: you spend x mana and des... | instruction | 0 | 81,011 | 2 | 162,022 |
No | output | 1 | 81,011 | 2 | 162,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n warriors in a row. The power of the i-th warrior is a_i. All powers are pairwise distinct.
You have two types of spells which you may cast:
1. Fireball: you spend x mana and des... | instruction | 0 | 81,012 | 2 | 162,024 |
No | output | 1 | 81,012 | 2 | 162,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,244 | 2 | 162,488 |
Tags: data structures, trees
Correct Solution:
```
from sys import stdin
class order_tree:
def __init__(self, n):
self.tree, self.n = [[0, 0] for _ in range(n << 1)], n
# get interval[l,r)
def query(self, r, col):
res = 0
l = self.n
r += self.n
while l < r:
... | output | 1 | 81,244 | 2 | 162,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,245 | 2 | 162,490 |
Tags: data structures, trees
Correct Solution:
```
# aadiupadhyay
import os.path
from math import gcd, floor, ceil
from collections import *
import sys
mod = 1000000007
INF = float('inf')
def st(): return list(sys.stdin.readline().strip())
def li(): return list(map(int, sys.stdin.readline().split()))
def mp(): return m... | output | 1 | 81,245 | 2 | 162,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,246 | 2 | 162,492 |
Tags: data structures, trees
Correct Solution:
```
"""
Approach:
for every element:
a = no of elements greater in left
b = no of elements smaller in right
ans is sigma(a*b) for all elements
Now to efficiently calculate no of such elements for every
element we use BIT
"""
import os
import sys
from io imp... | output | 1 | 81,246 | 2 | 162,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,247 | 2 | 162,494 |
Tags: data structures, trees
Correct Solution:
```
def update(bit ,i ) :
while(i < len(bit)) :
bit[i] += 1
i += (i & (-i))
def getsum(bit, i ) :
res = 0
while (i >0 ) :
res += bit[i]
i -= (i & (-i))
return res
n = int(input())
arr = list(map(int,input().split()))
l = ... | output | 1 | 81,247 | 2 | 162,495 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,248 | 2 | 162,496 |
Tags: data structures, trees
Correct Solution:
```
def update(bit, i):
while (i < len(bit)):
bit[i] += 1
i += (i & (-i))
def getsum(bit, i):
res = 0
while (i > 0):
res += bit[i]
i -= (i & (-i))
return res
n = int(input())
arr = list(map(int, input().split()))
d = {}
l... | output | 1 | 81,248 | 2 | 162,497 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,249 | 2 | 162,498 |
Tags: data structures, trees
Correct Solution:
```
def update(bit ,i ) :
while(i < len(bit)) :
bit[i] += 1
i += (i & (-i))
def getsum(bit, i ) :
res = 0
while (i >0 ) :
res += bit[i]
i -= (i & (-i))
return res
n = int(input())
lista = list(map(int,input().split()))
... | output | 1 | 81,249 | 2 | 162,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,250 | 2 | 162,500 |
Tags: data structures, trees
Correct Solution:
```
import sys
# FASTEST IO
from io import BytesIO, IOBase
from types import GeneratorType
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
self.os = os
self._fd = file.fileno()
self.buffer =... | output | 1 | 81,250 | 2 | 162,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has to find weaknesses in the Roman army to defeat... | instruction | 0 | 81,251 | 2 | 162,502 |
Tags: data structures, trees
Correct Solution:
```
def and_i(i):
return i & (i + 1)
def or_i(i):
return i | (i + 1)
class Tree:
def __init__(self, n):
self.n = n
self.tree = [0] * n
def get_sum(self, i):
ans = 0
while i >= 0:
ans += self.tree[i]
... | output | 1 | 81,251 | 2 | 162,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,252 | 2 | 162,504 |
Yes | output | 1 | 81,252 | 2 | 162,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,253 | 2 | 162,506 |
Yes | output | 1 | 81,253 | 2 | 162,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,254 | 2 | 162,508 |
Yes | output | 1 | 81,254 | 2 | 162,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,255 | 2 | 162,510 |
Yes | output | 1 | 81,255 | 2 | 162,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,256 | 2 | 162,512 |
No | output | 1 | 81,256 | 2 | 162,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,257 | 2 | 162,514 |
No | output | 1 | 81,257 | 2 | 162,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,258 | 2 | 162,516 |
No | output | 1 | 81,258 | 2 | 162,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".
Nevertheless Shapur has... | instruction | 0 | 81,259 | 2 | 162,518 |
No | output | 1 | 81,259 | 2 | 162,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,410 | 2 | 162,820 |
Tags: binary search
Correct Solution:
```
from bisect import bisect as bs
n, q = map(int, input().split())
a = list(map(int, input().split()))
k = list(map(int, input().split()))
tmp = 0
sumA = []
for i in range(n):
tmp += a[i]
sumA.append(tmp)
# print(sumA)
def bin_search(left, right, v):
if left > right... | output | 1 | 81,410 | 2 | 162,821 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,411 | 2 | 162,822 |
Tags: binary search
Correct Solution:
```
from bisect import bisect
n,t=map(int,input().split())
a=list(map(int,input().split()))
k=list(map(int,input().split()))
arr=[]
s=0
b=n
for i in a:
s+=i
arr.append(s)
ar=arr.copy()
s=0
for i in k:
s+=i
j=bisect(ar,s)
if j==n:
s=0
j=0
prin... | output | 1 | 81,411 | 2 | 162,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,412 | 2 | 162,824 |
Tags: binary search
Correct Solution:
```
# Link: https://codeforces.com/problemset/problem/975/C
def binarySearch(power, arr):
low, high = 0, len(arr) - 1
ans = -1
while low <= high:
mid = (low + high) // 2
if arr[mid] <= power:
ans = mid
low = mid + 1
else:... | output | 1 | 81,412 | 2 | 162,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,413 | 2 | 162,826 |
Tags: binary search
Correct Solution:
```
def search(arr,low,high,val):
while(low<=high):
mid=low+(high-low)//2
if(arr[mid]>=val):
high=mid-1
else:
low=mid+1
return low
n,m=map(int,input().split())
l=list(map(int,input().split()))
q=list(map(int,input().split()))
... | output | 1 | 81,413 | 2 | 162,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,414 | 2 | 162,828 |
Tags: binary search
Correct Solution:
```
import sys
import math
MAXNUM = math.inf
MINNUM = -1 * math.inf
ASCIILOWER = 97
ASCIIUPPER = 65
def getInt():
return int(sys.stdin.readline().rstrip())
def getInts():
return map(int, sys.stdin.readline().rstrip().split(" "))
def getString():
return sys.stdin.... | output | 1 | 81,414 | 2 | 162,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,415 | 2 | 162,830 |
Tags: binary search
Correct Solution:
```
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self... | output | 1 | 81,415 | 2 | 162,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,416 | 2 | 162,832 |
Tags: binary search
Correct Solution:
```
I=lambda:map(int,input().split())
from bisect import bisect_left as bl
n,q=I()
a=list(I())
b=list(I())
c=[];m=0
for i in a:
m+=i;c.append(m)
m=0
for i in range(q):
k=bl(c,b[i]+m)
if k==len(c) or b[i]+m==c[-1]:
print(n)
m=0
continue
elif ... | output | 1 | 81,416 | 2 | 162,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places them on a straight line in front of the main ga... | instruction | 0 | 81,417 | 2 | 162,834 |
Tags: binary search
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
from collections import Counter
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode ... | output | 1 | 81,417 | 2 | 162,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,418 | 2 | 162,836 |
Yes | output | 1 | 81,418 | 2 | 162,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,419 | 2 | 162,838 |
Yes | output | 1 | 81,419 | 2 | 162,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,420 | 2 | 162,840 |
Yes | output | 1 | 81,420 | 2 | 162,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,421 | 2 | 162,842 |
Yes | output | 1 | 81,421 | 2 | 162,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,422 | 2 | 162,844 |
No | output | 1 | 81,422 | 2 | 162,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,423 | 2 | 162,846 |
No | output | 1 | 81,423 | 2 | 162,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,424 | 2 | 162,848 |
No | output | 1 | 81,424 | 2 | 162,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.
Ivar has n warriors, he places ... | instruction | 0 | 81,425 | 2 | 162,850 |
No | output | 1 | 81,425 | 2 | 162,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mr. Chanek The Ninja is one day tasked with a mission to handle mad snakes that are attacking a site. Now, Mr. Chanek already arrived at the hills where the destination is right below these hills. The mission area can be divided into a grid ... | instruction | 0 | 84,422 | 2 | 168,844 |
Tags: combinatorics, dp, math
Correct Solution:
```
import sys
input = sys.stdin.readline
from sys import stdin, stdout
from collections import defaultdict, Counter
from functools import lru_cache
M = 10**9+7
fact = [1]*(2001)
def fac(n):
if(n==0 or n==1):
return 1
elif fact[n]!=1:
return fact[... | output | 1 | 84,422 | 2 | 168,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mr. Chanek The Ninja is one day tasked with a mission to handle mad snakes that are attacking a site. Now, Mr. Chanek already arrived at the hills where the destination is right below these hills. The mission area can be divided into a grid ... | instruction | 0 | 84,423 | 2 | 168,846 |
Tags: combinatorics, dp, math
Correct Solution:
```
# from __future__ import print_function,division
# range = xrange
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**4)
from sys import stdin, stdout
from collections import defaultdict, Counter
from functools import lru_cache
M = 10**9+7
fact = [1]*(200... | output | 1 | 84,423 | 2 | 168,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Chanek The Ninja is one day tasked with a mission to handle mad snakes that are attacking a site. Now, Mr. Chanek already arrived at the hills where the destination is right below these hill... | instruction | 0 | 84,424 | 2 | 168,848 |
No | output | 1 | 84,424 | 2 | 168,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Chanek The Ninja is one day tasked with a mission to handle mad snakes that are attacking a site. Now, Mr. Chanek already arrived at the hills where the destination is right below these hill... | instruction | 0 | 84,425 | 2 | 168,850 |
No | output | 1 | 84,425 | 2 | 168,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Chanek The Ninja is one day tasked with a mission to handle mad snakes that are attacking a site. Now, Mr. Chanek already arrived at the hills where the destination is right below these hill... | instruction | 0 | 84,426 | 2 | 168,852 |
No | output | 1 | 84,426 | 2 | 168,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Chanek The Ninja is one day tasked with a mission to handle mad snakes that are attacking a site. Now, Mr. Chanek already arrived at the hills where the destination is right below these hill... | instruction | 0 | 84,427 | 2 | 168,854 |
No | output | 1 | 84,427 | 2 | 168,855 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,805 | 2 | 169,610 |
"Correct Solution:
```
n,k,*h=map(int,open(0).read().split())
if k>=n:
print(0)
exit()
h.sort()
print(sum(h[:n-k]))
``` | output | 1 | 84,805 | 2 | 169,611 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,806 | 2 | 169,612 |
"Correct Solution:
```
R = lambda: map(int, input().split())
n, k = R()
print(sum(sorted(R())[:n - k]) if k < n else 0)
``` | output | 1 | 84,806 | 2 | 169,613 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,807 | 2 | 169,614 |
"Correct Solution:
```
N,H=map(int,input().split())
Mon=list(map(int,input().split()))
Mon=sorted(Mon)[::-1]
print(sum(Mon[H::]))
``` | output | 1 | 84,807 | 2 | 169,615 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,808 | 2 | 169,616 |
"Correct Solution:
```
N, K = map(int, input().split())
*H, = sorted(map(int, input().split()), reverse=True)
print(sum(H[K:]))
``` | output | 1 | 84,808 | 2 | 169,617 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,809 | 2 | 169,618 |
"Correct Solution:
```
N,K = map(int,input().split())
print(sum(sorted(map(int,input().split()))[:max(0,N-K)]))
``` | output | 1 | 84,809 | 2 | 169,619 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,810 | 2 | 169,620 |
"Correct Solution:
```
N,K = map(int,input().split())
H = sorted(list(map(int,input().split())))[::-1]
print(sum(H[K:]))
``` | output | 1 | 84,810 | 2 | 169,621 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,811 | 2 | 169,622 |
"Correct Solution:
```
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort(reverse=True)
print(sum(H[K::]))
``` | output | 1 | 84,811 | 2 | 169,623 |
Provide a correct Python 3 solution for this coding contest problem.
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
* Attack: Fennec chooses one monster. That monster's health will decrease by 1.
* Special Move: Fennec chooses one monster. That mo... | instruction | 0 | 84,812 | 2 | 169,624 |
"Correct Solution:
```
n,k = map(int,input().split())
l=sorted(list(map(int,input().split())))
print(sum(l[:max(0,n-k)]))
``` | output | 1 | 84,812 | 2 | 169,625 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.