input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(n)]
h = sorted(h)
ans = max(h[0:k]) - min(h[0:k])
for i in range(1, n-k+1):
ans = min(ans, max(h[i:i+k]) - min(h[i:i+k]))
print(ans)
| n, k = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(n)]
h = sorted(h)
ans = h[k-1] - h[0]
for i in range(1, n-k+1):
ans = min(ans, h[i+k-1] - h[i])
print(ans) | p03208 |
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h.sort()
m = 10 ** 10
for i in range(N-K+1):
tmp = h[i+K-1] - h[i]
if tmp < m:
m = tmp
print(m) | # input 高速化
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h.sort()
m = 10 ** 10
for i in range(N-K+1):
tmp = h[i+K-1] - h[i]
if tmp < m:
m = tmp
print(m) | p03208 |
n, k = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
from itertools import combinations
x = list(combinations(l, k))
y = []
for i in range(len(x)):
y.append(max(x[i]) - min(x[i]))
print((min(y)))
| n, k = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
l = sorted(l)
x = []
for i in range(n-k+1):
x.append(max(l[i:i+k]) - min(l[i:i+k]))
print((min(x))) | p03208 |
n, k = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
l = sorted(l)
#print(l)
x = []
for i in range(n-1):
x.append(l[i+1] - l[i])
x = sorted(x)
#print(x)
z = []
for j in range(n-k):
z.append(sum(x[j:j+k-1]))
print((min(z)))
| n, k = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
l = sorted(l)
#print(l)
x = []
for i in range(n-k+1):
x.append(l[i+k-1] - l[i])
x = sorted(x)
#print(x)
print((min(x[:k-1])))
| p03208 |
N, K = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
H = sorted(H)
ans = 999999999999999999999
for i in range(N-K+1):
ans = min(ans, H[i+K-1] - H[i])
print(ans) |
N, K = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
H.sort()
ans = 999999999999999999999
for i in range(N-K+1):
ans = min(ans, H[i+K-1] - H[i])
print(ans) | p03208 |
N, K = list(map(int, input().split()))
H = sorted([int(eval(input())) for _ in range(N)])
ans = float("inf")
for i in range(N-K+1):
t = H[i:i+K]
ans = min(ans, t[K-1]-t[0])
print(ans) |
N, K = list(map(int, input().split()))
H = sorted([int(eval(input())) for _ in range(N)])
ans = float("inf")
for i in range(N-K+1):
ans = min(ans, H[i+K-1]-H[i])
print(ans) | p03208 |
# sys.stdin.readline()
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
h = [0]*n
for i in range(n):
h[i] = int(eval(input()))
h.sort()
check = [0]*(n-k+1)
for i in range(n-k+1):
check[i] = h[i+k-1]-h[i]
print((min(check))) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, k = list(map(int, readline().split()))
h = [int(readline()) for _ in range(n)]
h.sort()
ans = float('inf')
for bf, af in zip(h, h[k - 1:]):
ans = min(ans,... | p03208 |
n, k = list(map(int, input().split()))
h = list(int(eval(input())) for _ in range(n))
h.sort()
mn = 10 ** 9
for i in range(n-k+1):
d = h[i+k-1] - h[i]
mn = min(mn, d)
print(mn) | n, k = list(map(int, input().split()))
h = list(int(eval(input())) for _ in range(n))
h.sort()
mn = 10 ** 9
for i in range(n-k+1):
mn = min(mn, h[i+k-1] - h[i])
print(mn) | p03208 |
N, K = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
H.sort()
ans = float("inf")
for i in range(len(H)-K+1):
ans = min(ans, max(H[i:i+K])- min(H[i:i+K]))
print(ans) | N, K = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
H.sort()
ans = float("inf")
for i in range(N-K+1):
ans = min(ans, H[i+K-1]-H[i])
print(ans) | p03208 |
ans = 10**10
N, K = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(N)])
for i in range(N-K+1):
ans = min(ans, h[i+K-1] - h[i])
print(ans) | import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(N)])
ans = float('inf')
for i in range(N-K+1):
ans = min(ans, h[i+K-1] - h[i])
print(ans)
if __name__ == '__main__':
... | p03208 |
import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
l=[0]*n
c=0
for i in range(n):
l[i]=int(eval(input()))
if l.count(l[i])>=k:
print((0))
c=1
if c==0:
l.sort()
print((l[k-1]-l[0])) | # coding: utf-8
# Your code here!
n,k=list(map(int,input().split()))
h=[]
for i in range(n):
h.append(int(eval(input())))
ans=10**10
c=0
h.sort()
for i in range(n-k+1):
c=h[i+k-1]-h[i]
if c<ans:
ans=c
print(ans) | p03208 |
N, K = list(map(int, input().split()))
h = []
for _ in range(N):
h.append(int(eval(input())))
h.sort()
ans = 10 ** 9
for i in range(N-K+1):
ans = min(ans, max(h[i:i+K])-min(h[i:i+K]))
print(ans)
| N, K = list(map(int, input().split()))
h = []
for _ in range(N):
h.append(int(eval(input())))
h.sort()
ans = 10 ** 9
for i in range(N-K+1):
ans = min(ans, h[i+K-1]-h[i])
print(ans)
| p03208 |
# ABC 115 C
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h.sort()
ans = 1.0e+9
for i in range(N-K+1):
ans = min(ans, max(h[i:i+K]) - min(h[i:i+K]))
print(ans)
| # ABC 115 C
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h.sort()
ans = 1.0e+9
for i in range(N-K+1):
ans = min(ans, h[i+K-1] - h[i])
print(ans)
| p03208 |
# coding:utf-8
import sys
from collections import Counter
input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
N, K = inpl()
H = []
for i in range(N):
H.append(int(eval(input())))
C = Counter(H)
H2 = sorted(H)
S = [0]
fo... | # coding:utf-8
import sys
input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
N, K = inpl()
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = INF
for i in range(N - K + 1):
ans = min(ans, H[i + K - 1] - H[i])
print(... | p03208 |
N,K = list(map(int,input().split()))
H = []
for n in range(N):
H.append(int(eval(input())))
H.sort()
ans = 10000000000
for n in range(N-K+1):
ans = min(ans,H[n+K-1]-H[n])
print(ans)
| N,K = list(map(int,input().split()))
H = [int(eval(input())) for n in range(N)]
H.sort()
ans = 10000000000
for n in range(N-K+1):
ans = min(ans,H[n+K-1]-H[n])
print(ans)
| p03208 |
n,k = list(map(int,input().split()))
h = []
ans = 1<<50
for i in range(n):
h.append(int(eval(input())))
h = sorted(h)
for i in range(n-k+1):
temp = h[i:i+k]
# print(temp)
ans = min(ans,temp[-1]-temp[0])
print(ans) | n,k = list(map(int,input().split()))
h = []
ans = 1<<50
for i in range(n):
h.append(int(eval(input())))
h = sorted(h)
for i in range(n-k+1):
ans = min(ans,h[i+k-1]-h[i])
print(ans) | p03208 |
N,K,*h=list(map(int,open(0).read().split()))
h.sort()
if K == N:
print((h[-1] - h[0]))
else:
dif_h=[]
for i in range(N-1):
dif_h.append(h[i+1] - h[i])
_min = base = sum(dif_h[:K-1])
for i in range(K-1,N-1):
base += dif_h[i]
base -= dif_h[i-K+1]
_min = min(... | N,K,*h=list(map(int,open(0).read().split()))
h.sort()
_min = 10**9
for i in range(N+1-K):
_min = min(_min, h[i+K-1] - h[i])
print(_min) | p03208 |
from itertools import combinations
N, K = [int(n) for n in input().split()]
h = [int(eval(input())) for _ in range(N)]
ans = 10**9+1
for c in combinations(h, K):
mc = max(c)-min(c)
if ans > mc:
ans = mc
print(ans)
| N, K = [int(n) for n in input().split()]
h = sorted([int(eval(input())) for _ in range(N)])
ans = 10**9
for i in range(N-K+1):
ans = min(ans, h[i+K-1]-h[i])
print(ans)
| p03208 |
N,K = list(map(int,input().split()))
hlist = [int(eval(input())) for _ in range(N)]
hlist.sort(reverse=True)
sa = []
for _ in range(N-K+1):
num = hlist[_]-hlist[_+(K-1)]
sa.append(num)
sa.sort()
print((sa[0]))
| N, K = list(map(int, input().split()))
hlist = sorted([int(eval(input())) for _ in range(N)])
ans = 10**9 + 7
for i in range(N - K + 1):
ans = min(ans, hlist[i + K - 1] - hlist[i])
print(ans)
| p03208 |
N, K = list(map(int, input().split()))
hlist = sorted([int(eval(input())) for _ in range(N)], reverse=True)
ans = 10**9 + 7
for i in range(N - K + 1):
# print(hlist[i], hlist[i + K])
ans = min(ans, hlist[i] - hlist[i + K - 1])
print(ans)
| N, K = list(map(int, input().split()))
hlist = sorted([int(eval(input())) for _ in range(N)])
ans = 10**9
for i in range(N-K+1):
ans = min(ans, abs(hlist[i] - hlist[i+K-1]))
print(ans)
| p03208 |
import itertools
N, K = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
ans = float("inf")
for s in itertools.permutations(H, K):
s = list(s)
s.sort()
ans = min(ans, s[K-1] - s[0])
print(ans) | # ans
N, K = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
H.sort()
print((min(H[i+K-1] - H[i] for i in range(N-K+1)))) | p03208 |
n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(n)])
h_dif = []
ans = 10 ** 9 + 1
for i in range(1, n):
h_dif.append(h[i]-h[i-1])
if i >= k-1:
ans = min(ans, sum(h_dif[i-k+1:i]))
print(ans) | n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(n)])
mind = 10 ** 9 + 1
for i in range(n-k+1):
mind = min(mind, h[i+k-1] - h[i])
print(mind) | p03208 |
n, k = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()
ans = 10 ** 10
for i in range(n-k+1):
ans = min(ans, h[i:i+k][-1] - h[i:i+k][0])
print(ans) | n, k = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()
ans = 10 ** 10
for i in range(n-k+1):
ans = min(ans, h[i+k-1] - h[i])
print(ans) | p03208 |
S = input().split(" ")
n = int(S[0])
k = int(S[1])
arr = []
for i in range(n):
arr.append(int(eval(input())))
def calculate(n,k,arr):
arr.sort()
drr = []
for i in range(1,n):
drr.append(arr[i] - arr[i-1])
i = 0
sums = []
while (i + k-1) <= len(drr):
tmp = su... | S = input().split(" ")
n = int(S[0])
k = int(S[1])
arr = []
for i in range(n):
arr.append(int(eval(input())))
def calculate(n, k, arr):
arr.sort()
drr = []
for i in range(1, n):
drr.append(arr[i] - arr[i - 1])
j = 0
s = 0
sums = []
for i in range(len(drr) - (k -... | p03208 |
S = input().split(" ")
n = int(S[0])
k = int(S[1])
arr = []
for i in range(n):
arr.append(int(eval(input())))
def calculate(n, k, arr):
arr.sort()
drr = []
for i in range(1, n):
drr.append(arr[i] - arr[i - 1])
j = 0
s = 0
sums = []
for i in range(len(drr) - (k -... | S = input().split(" ")
n = int(S[0])
k = int(S[1])
arr = []
for i in range(n):
arr.append(int(eval(input())))
def calculate(n, k, arr):
drr = []
arr.sort()
for i in range(1,n):
drr.append(arr[i] - arr[i-1])
s = 0
j = 0
sums = []
for i in range(len(drr)- (k-1) + 1)... | p03208 |
S = input().split(" ")
n = int(S[0])
k = int(S[1])
arr = []
for i in range(n):
arr.append(int(eval(input())))
def calculate(n, k, arr):
drr = []
arr.sort()
for i in range(1,n):
drr.append(arr[i] - arr[i-1])
s = 0
j = 0
sums = []
for i in range(len(drr)- (k-1) + 1)... | S = input().split(" ")
n = int(S[0])
k = int(S[1])
arr = []
for i in range(n):
arr.append(int(eval(input())))
def calculate(n,k,arr):
brr = []
arr.sort()
for i in range(1,n):
brr.append(arr[i] - arr[i-1])
j = 0
s = 0
sums = []
for i in range(0,len(brr) - (... | p03208 |
n,k =list(map(int,input().split()))
h =[0]*n
for i in range(n):
h[i]= int(eval(input()))
sort_h = sorted(h)
diff=10**9
for times in range(n-k+1):
maxh=0
minh=10**9
for i in range(times,k+times):
if sort_h[i] > maxh:
maxh= sort_h[i]
if sort_h[i] < minh:
minh=sort_h[i]
... | n,k =list(map(int,input().split()))
h =[0]*n
for i in range(n):
h[i]= int(eval(input()))
sort_h = sorted(h)
diffmin=10**9
for times in range(n-k+1):
diff = sort_h[k+times-1]-sort_h[times]
if diffmin > diff:
diffmin=diff
print(diffmin) | p03208 |
INF = 1000000007
N, K = list(map(int, input().split()))
h = [int(eval(input())) for i in range(N)]
h.sort()
ans = INF
for i in range(N - K + 1):
ans = min(ans, h[i + K - 1] - h[i])
print(ans)
| INF = 1000000007
N, K, *h = list(map(int, open(0).read().split()))
h.sort()
ans = INF
for i in range(N - K + 1):
ans = min(ans, h[i + K - 1] - h[i])
print(ans)
| p03208 |
INF = 1000000007
N, K, *h = list(map(int, open(0).read().split()))
h.sort()
ans = INF
for i in range(N - K + 1):
ans = min(ans, h[i + K - 1] - h[i])
print(ans)
| INF = 1000000007
input = open(0).read
N, K, *h = list(map(int, input().split()))
def main():
h.sort()
ans = INF
for i in range(N - K + 1):
ans = min(ans, h[i + K - 1] - h[i])
print(ans)
return
main()
| p03208 |
INF = 1000000007
input = open(0).read
N, K, *h = list(map(int, input().split()))
def main():
h.sort()
ans = INF
for i in range(N - K + 1):
ans = min(ans, h[i + K - 1] - h[i])
print(ans)
return
main()
| def main():
N, K, *h = list(map(int, open(0).read().split()))
h.sort()
print((min(j - i for i, j in zip(h, h[K - 1:]))))
return
main()
| p03208 |
n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(n)])
diff = [h[i+1] - h[i] for i in range(n-1)]
ans = float("inf")
for i in range(n-k+1):
ans = min(ans, sum(diff[i:i+k-1]))
print(ans) | n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(n)])
ans = float("inf")
for i in range(n-k+1):
ans = min(ans, h[i+k-1]-h[i])
print(ans) | p03208 |
n,k=list(map(int,input().split()))
h=list(int(eval(input())) for i in range(n))
h.sort()
c=[]
for i in range(n-k+1):
a=h[i+k-1]-h[i]
c.append(a)
print((min(c))) | n,k=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
h.sort()
l=[]
for i in range(n-k+1):
a=h[i+k-1]-h[i]
l.append(a)
print((min(l))) | p03208 |
N, K=list(map(int, input().split()))
h=[int(eval(input())) for i in range(N)]
h.sort()
diff=None
for i in range(N-(K-1)):
td=h[i+(K-1)]-h[i]
if diff is None or td<diff:
diff=td
print(diff) | N,K=list(map(int,input().split()))
h=[int(eval(input())) for _ in range(N)]
h.sort(reverse=True)
ans=None
for i in range(N-(K-1)):
diff=h[i]-h[i+(K-1)]
if ans is None or diff<ans:
ans=diff
print(ans) | p03208 |
import sys
import math
#sys.setrecursionlimit(10000)
n,k = list(map(int, input().split()))
h = sorted(list(map(int, (eval(input()) for i in range(n)))))
l = [0] * (n-1)
for i in range(n - 1):
l[i] = h[i + 1] - h[i]
ans = max(l)
for j in range(len(l) - (k - 2)):
ans = min(ans,sum(l[j:j + k - 1]... | import sys
import math
#sys.setrecursionlimit(10000)
n,k = list(map(int, input().split()))
h = sorted(list(map(int, (eval(input()) for i in range(n)))))
ans = max(h)
for i in range(n - k + 1):
ans = min(ans,h[i + k - 1] - h[i])
print(ans)
| p03208 |
import heapq
import queue
N, K = list(map(int, input().split()))
trees = []
heapq.heapify(trees)
for _ in range(N):
heapq.heappush(trees, int(eval(input())))
ans = 1 + 10**9
q = queue.Queue(maxsize=K-1)
for _ in range(K-1):
q.put(heapq.heappop(trees))
for _ in range(N-K+1):
curmin ... |
import sys
INPUT = sys.stdin.readline
def SINGLE_INT(): return int(INPUT())
def MULTIPLE_INT_LIST(): return list(map(int, INPUT().split()))
def MULTIPLE_INT_MAP(): return list(map(int, INPUT().split()))
def SINGLE_STRING(): return INPUT()
def MULTIPLE_STRING(): return INPUT().split()
N, K = MULTIPLE_INT_MA... | p03208 |
N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = []
for i in range(N-K+1):
tree = H[i:i+K]
ans.append(tree[-1]-tree[0])
print((min(ans))) | N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = []
for i in range(N-K+1):
ans.append(H[i+K-1]-H[i])
print((min(ans))) | p03208 |
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h = sorted(h)
diff_h = []
for i in range(N-1):
diff_h += [h[i+1] - h[i]]
ans = float('inf')
for i in range(N-K+1):
ans = min(ans, sum(diff_h[i:i+K-1]))
print(ans) | N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h = sorted(h)
ans = float('inf')
for i in range(N-K+1):
ans = min(ans, h[i+K-1]-h[i])
print(ans) | p03208 |
import sys
import os
if sys.platform=="darwin":
base = os.path.dirname(os.path.abspath(__file__))
name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
#print(name)
sys.stdin = open(name)
input = sys.stdin.readline
n,k = list(map(int,input().split()))
l = [int(eval(input())) for _ in ra... | import sys
import os
if sys.platform=="darwin":
base = os.path.dirname(os.path.abspath(__file__))
name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
#print(name)
sys.stdin = open(name)
input = sys.stdin.readline
n,k = list(map(int,input().split()))
l = [int(eval(input())) for _ in ra... | p03208 |
N,s = input().split()
S = int(s)
a = []
for i in range(int(N)):
a.append(int(eval(input())))
a.sort()
mindiff = 1000000000
for i in range(int(N)-(S - 1)):
v = 0
for j in range(int(S)-1):
v += a[i+j+1]-a[i+j]
if i%3 == 0 and mindiff < v:break
if mindiff > v: mindiff = ... | N,s = input().split()
S = int(s)
a = []
for i in range(int(N)):
a.append(int(eval(input())))
a.sort()
mindiff = 1000000000
for i in range(int(N)-(S - 1)):
v = a[i+S-1]-a[i]
if mindiff > v: mindiff = v
print(mindiff)
| p03208 |
N,K = list(map(int,input().split()))
h = []
h2 = []
ans = 10**10
for i in range(N):
tmp = int(eval(input()))
h.append(tmp)
h = sorted(h)
for i in range(N-K+1):
h2 = h[i:i+K]
ans = min(max(h2) - min(h2),ans)
print((str(ans))) | N,K = list(map(int,input().split()))
h = []
ans = 10**10
for i in range(N):
tmp = int(eval(input()))
h.append(tmp)
h = sorted(h)
for i in range(N-K+1):
h2 = h[i]
h3 = h[i+K-1]
ans = min(h3 - h2,ans)
print((str(ans))) | p03208 |
import sys
import math
import itertools as it
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return list(map(int,sys.stdin.readline().replace("\n","").split()))
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():retu... | import sys
import math
import itertools as it
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return list(map(int,sys.stdin.readline().replace("\n","").split()))
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():retu... | p03208 |
in_1 = input().split()
n = int(in_1[0])
k = int(in_1[1])
trees_height = []
for i in range(n):
trees_height.append(int(eval(input())))
trees_height.sort()
def sub_minmax(list):
return max(list)-min(list)
subs = []
for i in range(n+1-k):
subs.append(sub_minmax(trees_height[i:i+k]))
p... | in_1 = input().split()
n = int(in_1[0])
k = int(in_1[1])
trees_height = []
for i in range(n):
trees_height.append(int(eval(input())))
trees_height.sort()
def sub_minmax(list):
return max(list)-min(list)
subs = []
for i in range(n+1-k):
subs.append(trees_height[i+k-1]-trees_height[i])
... | p03208 |
n,k=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
h=sorted(h)
min_=float('inf')
for i in range(n-k+1):
min_=min(min_,abs(h[i]-h[i+k-1]))
print(min_) | n,k=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
h=sorted(h)
ans=10**10
for i in range(n-k+1):
ans=min(ans,h[i+k-1]-h[i])
print(ans) | p03208 |
N,K = (int(i) for i in input().split())
h = [int(eval(input())) for i in range(N)]
h.sort()
ans=[]
for i in range(N):
if i+K==N+1:
break
else:
ans.append(max(h[i:i+K]) - min(h[i:i+K]))
print((min(ans)))
| N,K = (int(i) for i in input().split())
h = [int(eval(input())) for i in range(N)]
h.sort()
ans=[]
for i in range(N):
if i+K==N+1:
break
else:
ans.append(h[i+K-1] - h[i])
print((min(ans))) | p03208 |
N, K = list(map(int,input().split()))
h = [int(eval(input())) for i in range(N)]
h.sort()
for i in list(set(h)):
if(h.count(i) >= K):
print('0')
exit()
trees = h[:K]
h_max = max(trees)
h_min = min(trees)
print((h_max - h_min)) | N, K = list(map(int,input().split()))
h = sorted([int(eval(input())) for i in range(N)])
trees = [h[i+K-1] - h[i] for i in range(N-K+1)]
print((min(trees)))
| p03208 |
N, K = list(map(int,input().split()))
H = sorted([int(eval(input())) for _ in range(N)])
heights = []
for i in range(N-K+1):
heights.append(H[i+K-1]-H[i])
print((min(heights))) | N, K = list(map(int,input().split()))
H = sorted([int(eval(input())) for _ in range(N)])
result = []
for i in range(N-K+1):
result.append(H[i+K-1] - H[i])
print((min(result))) | p03208 |
def ans():
N, K = list(map(int,input().split()))
H = sorted([int(eval(input())) for _ in range(N)])
res = 1e9+7
for i in range(N-K+1):
tmp = H[i:i+K]
res = min(res, max(tmp)-min(tmp))
print(res)
ans() | def ans():
N, K = list(map(int,input().split()))
H = sorted([int(eval(input())) for _ in range(N)])
res = 1e9+7
for i in range(N-K+1):
x = H[i+K-1] - H[i]
if(res > x):
res = x
print(res)
ans() | p03208 |
N, K, *h = list(map(int, open(0).read().split()))
h = sorted(list(h))
ans = float("inf")
for i in range(N - K + 1):
ans = min(ans, h[i + K - 1] - h[i])
print(ans)
| N, K, *h = list(map(int, open(0).read().split()))
h = sorted(list(h))
print((min(h[i + K - 1] - h[i] for i in range(N - K + 1))))
| p03208 |
# https://atcoder.jp/contests/abc115/tasks/abc115_c
# C - Christmas Eve
import itertools
n, k = list(map(int, input().split()))
h_list = []
for _ in range(n):
h_list.append(int(input().split()[0]))
# 全探索で頑張る方法
# 多分時間が足りない
p_list = itertools.combinations(h_list, k)
min_value = float('inf')
for p i... | # https://atcoder.jp/contests/abc115/tasks/abc115_c
# C - Christmas Eve
import itertools
n, k = list(map(int, input().split()))
h_list = []
for _ in range(n):
h_list.append(int(input().split()[0]))
h_list = sorted(h_list)
min_value = float('inf')
for i, v in enumerate(h_list[:-k+1]):
diff_h ... | p03208 |
import itertools
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
hmin = 10**9
for selected in itertools.combinations(h, K):
delta = max(selected) - min(selected)
hmin = min(hmin, delta)
print(hmin) | N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]
h.sort()
hmin = min(h[i+K-1] - h[i] for i in range(N-K+1))
print(hmin) | p03208 |
n,k=list(map(int,input().split()))
h=[]
for i in range(n):
h.append(int(eval(input())))
h.sort()
ans=10**9
a=[]
for i in range(n-k+1):
ans=min(ans,max(h[i:i+k])-min(h[i:i+k]))
print(ans) | n,k=list(map(int,input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()
ans=10**9
for i in range(n-k+1):
ans=min(ans,h[i+k-1]-h[i])
print(ans) | p03208 |
N, K = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(N)])
min_max = lambda x: max(x) - min(x)
print((min([min_max(h[i:i+K]) for i in range(N-K+1)])))
| N, K = list(map(int, input().split()))
h = sorted([int(eval(input())) for i in range(N)])
print((min([h[i+K-1] - h[i] for i in range(N-K+1)]))) | p03208 |
N,K = list(map(int,input().split(" ")))
h = sorted([ int(eval(input())) for _ in range(N) ])
ans = float('inf')
for i in range(N-K+1):
lst = h[i:i+K]
ans = min(lst[-1]-lst[0],ans)
print(ans) | N,K = list(map(int,input().split(" ")))
h = sorted([ int(eval(input())) for _ in range(N) ])
print((min([ h[i+K-1]-h[i] for i in range(N-K+1) ]))) | p03208 |
n,k=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
h=sorted(h)
s=[]
for i in range(n-1):
s.append(h[i+1]-h[i])
t=[]
for i in range(n-k+1):
t.append(sum(s[i:i+k-1]))
print((min(t))) | n,k=list(map(int,input().split()))
h=sorted(int(eval(input())) for i in range(n))
ans=10**10
for i in range(n-k+1):
ans=min(h[i+k-1]-h[i],ans)
print(ans) | p03208 |
n, k = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()
ans = max(h)
for i in range(n-k+1):
hi = h[i:i+k]
ans = min(ans, max(hi) - min(hi))
print(ans) | n, k = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()
ans = max(h)
for i in range(n-k+1):
ans = min(ans, h[i+k-1] - h[i])
print(ans) | p03208 |
n, k = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(n)]
H = sorted(H)
ans = float('inf')
for i in range(n - k + 1):
ans = min(ans, H[i + k - 1] - H[i])
print(ans) | def main():
n, k = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(n)]
H.sort()
ans = 10 ** 9 + 2
for i in range(n - k + 1):
ans = min(ans, H[i + k - 1] - H[i])
print(ans)
if __name__ == '__main__':
main()
| p03208 |
n,k=list(map(int,input().split()))
h=sorted([int(eval(input())) for _ in range(n)])
a=10**9
for i in range(n-k+1):
h1=h[i:i+k]
a1=h1[-1]-h1[0]
a=min(a,a1)
print(a) | n,k=list(map(int,input().split()))
h=sorted([int(eval(input())) for _ in range(n)])
a=10**9
for i in range(n-k+1):
a1=h[i+k-1]-h[i]
a=min(a,a1)
print(a) | p03208 |
N, K = [int(x) for x in input().split()]
h = [int(eval(input())) for x in range(N)]
h.sort()
print((min([h[i+K-1] - h[i] for i in range(N-K+1)])))
| #!/usr/bin/env python3
import sys
INF = float("inf")
def solve(N: int, K: int, h: "List[int]"):
h.sort()
print((min(h[i+K-1]-h[i] for i in range(N-K+1))))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
... | p03208 |
n,k = list(map(int,input().split()))
H = sorted([int(eval(input())) for _ in range(n)])
ans = float("INF")
for i in range(0,n - k + 1):
selected = H[i:k + i]
ans = min(ans,max(selected) - min(selected))
print(ans) | n,k = list(map(int,input().split()))
H = sorted([int(eval(input())) for _ in range(n)])
ans = float("INF")
for i in range(n - k + 1):
diff = H[k + i -1] - H[i]
ans = min(ans,diff)
print(ans) | p03208 |
N, K = list(map(int, input().split()))
heights = sorted([int(eval(input())) for _ in range(N)])
ans = float('inf')
for i in range(N - K + 1):
if abs(heights[i] - heights[i + K - 1]) < ans:
ans = abs(heights[i] - heights[i + K - 1])
print(ans) | import sys
input = sys.stdin.readline
N, K = list(map(int, input().rstrip().split()))
heights = sorted([int(input().rstrip()) for _ in range(N)])
ans = float('inf')
for i in range(N - K + 1):
if abs(heights[i] - heights[i + K - 1]) < ans:
ans = abs(heights[i] - heights[i + K - 1])
print(ans) | p03208 |
n,k=list(map(int,input().split()))
h=[]
for i in range(n):
h.append(int(eval(input())))
h.sort()
ans=10**10
for i in range(n-k+1):
t=h[i+k-1]-h[i]
ans=min(t,ans)
print(ans)
| n,k=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
h.sort()
ans=10**18
for i in range(n-k+1):
ans=min(h[i+k-1]-h[i],ans)
print(ans)
| p03208 |
N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(eval(input())))
h.sort()
diff = []
for i in range(K-1, N):
diff.append(h[i] - h[i-K+1])
print((min(diff)))
| N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(eval(input())))
h.sort()
diff = 10 ** 9
for i in range(K-1, N):
diff = min(diff, h[i] - h[i-K+1])
print(diff)
| p03208 |
n, k =list(map(int, input().split()))
T = []
D = []
for i in range(n):
tree = int(eval(input()))
T.append(tree)
T.sort(reverse=True)
for i in range(n - k + 1):
diff = T[i] - T[i + k -1]
D.append(diff)
print((min(D))) | n, k = list(map(int, input().split()))
A = []
D = []
for i in range(n):
A.append(int(eval(input())))
A.sort(reverse=True)
for i in range(n - k + 1):
diff = A[i] - A[i + k -1]
D.append(diff)
print((min(D))) | p03208 |
n, k = list(map(int, input().split()))
H = [int(eval(input())) for i in range(n)]
H.sort(reverse=True)
ans = 10 ** 9
for i in range(n-k+1):
h = H[i] - H[i+k-1]
ans = min(ans, h)
print(ans) | n, k = list(map(int, input().split()))
A = [int(eval(input())) for i in range(n)]
A.sort(reverse=True)
B = []
for i in range(n-k+1):
diff = A[i] - A[i+k-1]
B.append(diff)
print((min(B))) | p03208 |
# -*- coding: utf-8 -*-
n, k = list(map(int,input().split()))
h = []
for i in range(n):
h.append(int(eval(input())))
ans = 10 ** 18
h.sort()
for i in range(n - k + 1):
if ans > h[i + k - 1] - h[i]:
ans = h[i + k - 1] - h[i]
print(ans)
| # -*- coding: utf-8 -*-
n, k = list(map(int,input().split()))
h = []
for i in range(n):
h.append(int(eval(input())))
h.sort()
ans = 10 ** 5 * 10 ** 10
for i in range(n - k + 1):
#print(i, i + k - 1)
if h[i + k - 1] - h[i] < ans:
ans = h[i + k - 1] - h[i]
print(ans)
| p03208 |
N,K=list(map(int,input().split()))
H=[]
for i in range(N):
H.append(int(eval(input())))
H.sort()
ans=H[K-1]-H[0]
for i in range(N-K+1):
A=H[i:i+K]
if ans>A[K-1]-A[0]:
ans=A[K-1]-A[0]
print(ans) | N,K=list(map(int,input().split()))
H=[]
for i in range(N):
H.append(int(eval(input())))
H.sort()
print((min(H[i+K-1]-H[i] for i in range(N-K+1)))) | p03208 |
n,k = list(map(int,input().split()))
f = [int(eval(input())) for i in range(n)]
li = []
f.sort()
for i in range(n-k+1) :
li.append(max(f[i:i+k])-min(f[i:i+k]))
print((min(li))) | n,k = list(map(int,input().split()))
f = [int(eval(input())) for i in range(n)]
li = []
f.sort()
for i in range(n-k+1) :
li.append(f[i+k-1]-f[i])
print((min(li))) | p03208 |
from collections import Counter
N , K = list(map(int,input().split()))
h = list(int(eval(input())) for _ in range(N))
h.sort()
min = 10 ** 10
for i in range(len(h) - K + 1):
tmp_min = h[i + K - 1] - h[i]
if min > tmp_min:
min = tmp_min
print(min)
| N, K = list(map(int, input().split()))
trees = list(int(eval(input())) for _ in range(N))
trees.sort()
ans = float("inf")
for i in range(N - K + 1):
tmp_ans = trees[i + K - 1] - trees[i]
if tmp_ans < ans:
ans = tmp_ans
print(ans) | p03208 |
import heapq
n, k = list(map(int, input().split()))
h = []
d = [0 for _ in range(n)]
ans = float('inf')
for _ in range(n):
heapq.heappush(h, int(eval(input())))
h = [heapq.heappop(h) for _ in range(n)]
for i in range(n - k + 1):
diff = h[i + k - 1] - h[i]
ans = min(ans, diff)
print(an... | n, k = list(map(int, input().split()))
h = []
d = [0 for _ in range(n)]
ans = 1e9
for _ in range(n):
h.append(int(eval(input())))
h = sorted(h)
for i in range(n - k + 1):
diff = h[i + k - 1] - h[i]
ans = min(ans, diff)
print(ans)
| p03208 |
N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in [0]*N]
h = sorted(h)
ans = []
for i in range(len(h)-K+1):
a = h[i:i+K]
ans.append(max(a)-min(a))
if ans[-1] == 0:
print((0))
exit()
print((min(ans))) | N, K = list(map(int, input().split()))
h = [int(eval(input())) for _ in [0]*N]
h = sorted(h)
ans = []
for i in range(len(h)-K+1):
ans.append(h[i+K-1]-h[i])
if ans[-1] == 0:
print((0))
exit()
print((min(ans))) | p03208 |
N, K = list(map(int, input().split()))
h = []
ans = 10**9
for i in range(N):
h.append(int(eval(input())))
h.sort()
for i in range(N-K+1):
ans = min(max(h[i:i+K]) - min(h[i:i+K]), ans)
print(ans) | N, K = list(map(int, input().split()))
h = []
ans = 10**9
for i in range(N):
h.append(int(eval(input())))
h.sort()
for i in range(N-K+1):
ans = min(h[i+K-1]-h[i], ans)
print(ans) | p03208 |
def resolve():
N,K=list(map(int,input().split()))
H=sorted([int(eval(input())) for i in range(N)])
ans=10**20
for i in range(N-K+1):
ans=min(H[i+K-1]-H[i], ans)
print(ans)
resolve()
| import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n,k=list(map(int,input().split()))
h=sorted([int(eval(input())) for i in range(n)])
ans=10**20
for i in range(n-k+1):
ans=min(ans,h[i+k-1]-h[i])
print(ans)
resolve() | p03208 |
N,K = input().split()
N = int(N)
K = int(K)
trees = []
for i in range(N) :
trees.append(int(eval(input())))
trees.sort()
min_diff = 99999999999
for i in range(N-K+1) :
arr = trees[i:i+K]
max_v = max(arr)
min_v = min(arr)
diff = max_v - min_v
if (min_diff > diff) :
min_diff = diff
if (min_dif... | N,K = input().split()
N = int(N)
K = int(K)
trees = []
for i in range(N) :
trees.append(int(eval(input())))
trees.sort()
min_diff = 99999999999
for i in range(N-K+1) :
max_v = trees[i+K-1]
min_v = trees[i]
diff = max_v - min_v
if (min_diff > diff) :
min_diff = diff
if (min_diff == 0) :
brea... | p03208 |
N, K = list(map(int, input().split()))
H = list(int(eval(input())) for _ in range(N))
H.sort()
ans = 10 ** 18
for i in range(N - K + 1):
tmp = H[i + K - 1] - H[i]
ans = min(ans, tmp)
print(ans)
| N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = 10 ** 18
for i in range(N - K + 1):
h1 = H[i]
h2 = H[i + K - 1]
ans = min(ans, h2 - h1)
print(ans) | p03208 |
n,k = list(map(int,input().split()))
h = []
ans = 10**10
for i in range(n):
h.append(int(eval(input())))
h.sort()
for i in range(n-k+1):
tmp = h[i:i+k]
buf = tmp[-1] - tmp[0]
if buf < ans:
ans = buf
print(ans)
| n,k = list(map(int,input().split()))
h = []
ans = 10**10
for i in range(n):
h.append(int(eval(input())))
h.sort()
for i in range(n-k+1):
buf = h[i+k-1] - h[i]
if buf < ans:
ans = buf
print(ans)
| p03208 |
n, k = tuple(map(int, input().split()))
arr = [0 for i in range(n)]
sums = 0
for i in range(n):
inp = int(eval(input()))
arr[i] = inp
arr.sort()
sa = 1000000000
for i in range(n-k+1):
newsa = max(arr[i:i+k]) - min(arr[i:i+k])
if newsa < sa:
sa = newsa
print(sa)
| n, k = tuple(map(int, input().split()))
arr = [0 for i in range(n)]
sums = 0
for i in range(n):
inp = int(eval(input()))
arr[i] = inp
arr.sort()
sa = 1000000000
for i in range(n-k+1):
newsa = arr[i+k-1] - arr[i]
if newsa < sa:
sa = newsa
print(sa)
| p03208 |
N_K = input().split()
N = int(N_K[0])
K = int(N_K[1])
Hs = sorted([int(eval(input())) for i in range(N)])
Hs_diff = [Hs[i+1] - Hs[i] for i in range(N) if i<(N-1)]
Hs_diff_K = [sum(Hs_diff[(i):(i+K-1)]) for i in range(len(Hs_diff)) if i < len(Hs_diff)-K+2]
print((min(Hs_diff_K))) | N_K = input().split()
N = int(N_K[0])
K = int(N_K[1])
Hs = sorted([int(eval(input())) for i in range(N)])
Hs_diff_K = [Hs[K+i-1] - Hs[i] for i in range(N) if i < N-K+1]
print((min(Hs_diff_K))) | p03208 |
while 1:
n=list(map(int,input().split()))
if n[0]==0:break
a=0
for i in range(n[0],n[1]+1):
b=i
while b%2==0: b/=2
while b%3==0: b/=3
while b%5==0: b/=5
if b==1:a+=1
print(a) | while 1:
n=list(map(int,input().split()))
if n[0]==0:break
a=0
for i in range(n[0],n[1]+1):
b=i
while b%5==0: b/=5
while b%3==0: b/=3
while b%2==0: b/=2
if b==1:a+=1
print(a) | p00162 |
def two(n):
if n == 1:
return True
elif n%2 != 0:
return three(n)
else:
q = n/2
return two(q)
def three(n):
if n == 1:
return True
elif n%3 != 0:
return five(n)
else:
q = n/3
return three(q)
def five(n):
if ... | def two(n):
if n == 1:
return True
elif n%2 != 0:
return three(n)
else:
q = n/2
return two(q)
def three(n):
if n == 1:
return True
elif n%3 != 0:
return five(n)
else:
q = n/3
return three(q)
def five(n):
if ... | p00162 |
import heapq
n, k = list(map(int, input().split()))
list_A = list(map(int, input().split()))
list_H = []
for a in list_A:
list_H.append(((-1)*a, a, 1))
heapq.heapify(list_H)
for _ in range(k):
l = heapq.heappop(list_H)
c = 0
if l[1] % (l[2]+1) == 0:
c = l[1] // (l[2]+1)
else:... | n, k = list(map(int, input().split()))
list_A = list(map(int, input().split()))
l, r = 0, max(list_A)
while l + 1 < r:
m, cnt = (r + l) // 2, 0
for a in list_A:
cnt += (a-1)//m
if cnt > k:
l = m
else:
r = m
print(r) | p02598 |
import math
import heapq
n, k = list(map(int, input().split()))
a = [(-int(x), 1) for x in input().split()]
heapq.heapify(a)
for i in range(k):
key = heapq.heappop(a)
heapq.heappush(a, (key[0]*key[1]/(key[1]+1), key[1]+1))
print((math.ceil(-heapq.heappop(a)[0]))) | import math
n, k = list(map(int, input().split()))
a = [int(x) for x in input().split()]
l, r = 0, 10**9+2
while r-l > 1:
key = (r+l)//2
count = 0
for i in range(n):
count += (a[i]-1)//key
if count <= k:
r = key
else:
l = key
print(r) | p02598 |
from math import ceil
n, k = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
a.sort()
l, r = 0, 10**9
while r-l > 1:
m = (l+r)//2
c = 0
for i in range(n):
if a[i] < m:
continue
c += a[i]//m-(a[i] % m == 0)
# print(c, l, r, m)
... | from math import ceil
n, k = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
# a.sort()
l, r = 0, 10**9
while r-l > 1:
m = (l+r)//2
c = 0
for i in range(n):
if a[i] < m:
continue
c += a[i]//m-(a[i] % m == 0)
# print(c, l, r, m... | p02598 |
import math
n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
a.sort()
r = a[n-1]
l = 0
def calc(t,x):
return math.ceil(t / x) - 1
while r - l > 1:
mid = (r+l)//2
count = 0
for i in a:
count += calc(i,mid)
if count > k:
l = mid
... | import math
n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
a.sort()
r = a[n-1]
l = 0
def calc(t,x):
return (t-1) // x
while r - l > 1:
mid = (r+l)//2
count = 0
for i in a:
count += calc(i,mid)
if count > k:
l = mid
else:
... | p02598 |
from math import ceil
from fractions import Fraction
from sys import exit
import heapq
n,k, *aa = list(map(Fraction, open(0).read().split()))
left = k/2
right = k*2 + 1
mid = k/2
summ = sum(aa)
score = None
while 1:
x = [(ceil(mid*a/summ), a) for a in aa]
prev = score
score = sum(a[0]-1 for... | from math import ceil
n,k, *aa = list(map(int, open(0).read().split()))
left = 0
right = 10**9
while right - left > 1:
mid = (left + right) // 2
summ = sum(0--a//mid-1 for a in aa)
if summ <= k:
right = mid
else:
left = mid
print(right) | p02598 |
from math import ceil
from fractions import Fraction
n, k, *aa = list(map(Fraction, open(0).read().split()))
imp_length = 0
psbl_length = max(aa)
while psbl_length - imp_length > 1:
mid = (psbl_length + imp_length) // 2
cost = sum(ceil(a / mid) - 1 for a in aa)
if cost <= k:
psbl_leng... | n, k, *aa = list(map(int, open(0).read().split()))
imp_length = 0
psbl_length = max(aa)
while psbl_length - imp_length > 1:
mid = (psbl_length + imp_length) // 2
cost = sum(0 - -a // mid - 1 for a in aa)
if cost <= k:
psbl_length = mid
else:
imp_length = mid
print(psbl_le... | p02598 |
import math
N,K=list(map(int,input().split()))
A=[int(x) for x in input().split()]
A=sorted(A)
left=0
right=max(A)
mid=max((left+right)//2,1)
while(right-left>=1):
numofcut=0
for i in range(N):
if A[i]%mid==0:
numofcut+=(A[i]//mid) -1
else:
numofcut+... | import math
N,K=list(map(int,input().split()))
A=[int(x) for x in input().split()]
A=sorted(A)
left=0
right=max(A)
mid=max((left+right)//2,1)
while(right-left>=1):
numofcut=0
for i in range(N):
numofcut+=math.ceil(A[i]/mid)-1
#print(numofcut)
if numofcut>K:
left=mid... | p02598 |
"""
AtCoder :: Beginner Contest 174 :: Logs
https://atcoder.jp/contests/abc174/tasks/abc174_e
"""
import sys
import math
import heapq
def main():
"""Main program."""
log_count, cut_count = (int(i) for i in sys.stdin.readline().split())
logs = [(-float(i), 0, float(i)) for i in sys.stdin.readli... | """
AtCoder :: Beginner Contest 174 :: Logs
https://atcoder.jp/contests/abc174/tasks/abc174_e
"""
import sys
from math import ceil
def main():
"""Main program."""
log_count, cut_count = (int(i) for i in sys.stdin.readline().split())
logs = [int(i) for i in sys.stdin.readline().split()]
hig... | p02598 |
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
a[i] = [(-1) * a[i], (-1) * a[i], 1]
import heapq
heapq.heapify(a)
for _ in range(k):
i = heapq.heappop(a)
i[2] += 1
i[0] = i[1] / i[2]
heapq.heappush(a, i)
fro... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# binary search
left = 1
right = 10 ** 9
while left < right:
center = (left + right) // 2
total = 0
for i in a:
if i % center == 0:
i -= 1
total += i//center
if total > k:
... | p02598 |
#!/usr/bin/env python
# coding: utf-8
# In[16]:
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
# In[41]:
cnt = 0
low = 0
high = max(A)
ans = max(A)
old = int(high)
mycount = 0
while low < high:
mid = (high+low)/2
cnt = sum([(x-0.001)//mid for x in A])
... | #!/usr/bin/env python
# coding: utf-8
# In[16]:
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
# In[49]:
low = 0
high = max(A)
def ok(x):
cnt = 0
for a in A:
cnt += (a//x)
if a%x == 0:
cnt -= 1
return cnt <= K
while high-... | p02598 |
#!/usr/bin/env python3
import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate
import math
sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7
def main():
N, K = list(map(int, input().split()))
A =... | #!/usr/bin/env python3
import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate
import math
sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7
def main():
N, K = list(map(int, input().split()))
A =... | p02598 |
# https://atcoder.jp/contests/abc174/tasks/abc174_e
from math import ceil,floor
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
L=0
R=max(A)
i=0
ans=(L+R)/2
cnt=0
right=0
left=0
while i<1000:
i +=1
for num in A:
cnt += ceil(num/ans)-1
if cnt <=K:
R =... | # https://atcoder.jp/contests/abc174/tasks/abc174_e
from math import ceil,floor
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
L=0
R=max(A)
i=0
ans=(L+R)/2
cnt=0
right=0
left=0
while i<100:
i +=1
for num in A:
cnt += ceil(num/ans)-1
if cnt <=K:
R = ... | p02598 |
#!/usr/bin/env python3
from bisect import insort_left
from collections import deque
from math import ceil
n, k = list(map(int, input().split()))
a = [[i, 1] for i in map(int, input().split())]
A = sorted(a)
while k > 0:
q, c = A.pop()
insort_left(A, [q * c / (c + 1), c + 1])
k -= 1
print((ceil(... | #!/usr/bin/env python3
from bisect import bisect_left
n, k = list(map(int, input().split()))
*a, = list(map(int, input().split()))
def is_ok(arg):
# 条件を満たすかどうか？問題ごとに定義
return sum(-(-i // arg) - 1 for i in a) <= k
def meguru_bisect(ng, ok):
'''
初期値のng,okを受け取り,is_okを満たす最小(最大)のokを返す
まずi... | p02598 |
N, K=list(map(int, input().split()))
A=list(map(int, input().split()))
x=0
y=max(A)
def f(l):
nums=0
for a in A:
t=1
while a/t>l:
t+=1
nums+=t-1
if nums>K:
return False
else:
return True
while y-x>1:
tmp=(x+y)//2
if f(tmp)==True:
y=tmp
else:
x=tm... | N, K=list(map(int, input().split()))
A=list(map(int, input().split()))
x=0
y=max(A)
def f(l):
nums=0
for a in A:
if a%l==0:
nums+=a//l-1
else:
nums+=a//l
if nums>K:
return False
else:
return True
while y-x>1:
tmp=(x+y)//2
if f(tmp)==True:
y=tmp
else... | p02598 |
import base64
exec(base64.b64decode(b'aW1wb3J0IHN1YnByb2Nlc3MKaW1wb3J0IHN5cwoKY29kZSA9IHIiIiIjaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8Yml0c2V0PgojaW5jbHVkZSA8Y2Fzc2VydD4KI2luY2x1ZGUgPGNjdHlwZT4KI2luY2x1ZGUgPGNocm9ubz4KI2luY2x1ZGUgPGNtYXRoPgojaW5jbHVkZSA8Y29tcGxleD4KI2luY2x1ZGUgPGNzdHJpbmc+CiNpbmNsdWRlIDxkZXF1ZT4KI2l... | import base64
exec(base64.b85decode(b'X>D+Ca&#bbbz*RGZ)0V1a|&r~aBp&SAai+h3JPOyWMv>dAaWuiA|q*TV{CO~Wgt9ZY-ewBX>@39J_;jgZewh9WMv>cVrg`9Wpq9YBWZ49Y;|O1AUtDXb8}^KbUq3rX>Ma|b!25AJY!>Yd2nSu3L|N5V{CO~Wgt9bXmW3EZ$1hmX>Ma|b!25AJY#KPbZ9;bBWZ49Y;|O1AUtDlZE$R5cs>dvX>Ma|b!25AJY#coa%pa7J_;jgZewh9WMv>cWMy%6Wj+ccX>Ma|b!25AJZW!jVQy(... | p02598 |
import heapq
import math
def solve():
N, K = list(map(int, input().split()))
A = list([(-float(a), -int(a), 1) for a in input().split()])
heapq.heapify(A)
for _ in range(K):
a = heapq.heappop(A)
heapq.heappush(A, (a[1] / (a[2] + 1.0), a[1], a[2]+1))
ans = -heapq.heappop(... | import heapq
import math
def solve():
N, K = list(map(int, input().split()))
A = sorted(map(int, input().split()), reverse=True)
l = 0
r = A[0]
# (l, r]
#print(A)
#print("K=",K)
while r - l> 1:
m = (r + l) // 2
cuts = 0
for a in A:
cuts... | p02598 |
import bisect
n,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
def cnt(x):
ret = 0
for ai in a:
ret += (ai+(x-1))//x - 1
return ret
ok, ng = a[-1], 0
while ok - ng > 1:
nw = (ok + ng) // 2
if cnt(nw)<=k:
ok = nw
else:
ng = nw
print(ok) | #!/usr/bin python3
# -*- coding: utf-8 -*-
import bisect
n,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
def cnt(x):
ret = 0
for ai in a:
ret += (ai+(x-1))//x - 1
return ret
ok, ng = a[-1], 0
while ok - ng > 1:
nw = (ok + ng) // 2
if cnt(nw)<=k:
ok... | p02598 |
#abc174_e
from math import ceil
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
if k==0:
ans=max(a)
print(ans)
exit()
if k==1:
if n==1:
print((-(-a[0]//2)))
exit()
ans=max(a[-1]/2,a[-2])
print((ceil(ans)))
ok=10**9+1
ng=1
def ... | #abc174_e
from math import ceil
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
if k==0:
ans=max(a)
print(ans)
exit()
if k==1:
if n==1:
print((-(-a[0]//2)))
exit()
ans=max(a[-1]/2,a[-2])
print((ceil(ans)))
exit()
ok=10**9+1... | p02598 |
from math import *
f=lambda:[*list(map(int,input().split()))]
n,k=f()
a=f()
def ok(x):
c=0
for i in a:
c+=ceil(i/x)
return c<=n+k
l,r=0,10**9
while r-l>1:
m=(l+r)/2
if ok(m): r=m
else: l=m
t=ceil(r)
print((t-ok(t-1) if t>1 else t)) | f=lambda:[*list(map(int,input().split()))]
n,k=f()
a=f()
def ok(x):
c=0
for i in a:
c+=0--i//x
return c<=n+k
l,r=0,10**9
while r-l>1:
m=l+r>>1
if ok(m): r=m
else: l=m
print(r) | p02598 |
from functools import cmp_to_key
import heapq
def func(a, b):
if a[0] * b[1] == a[1] * b[0]:
return 0
elif a[0] * b[1] > a[1] * b[0]:
return - 1
else:
return 1
n, k = list(map(int, input().split()))
c = cmp_to_key(func)
hq = list([c((int(x), 1)) for x in input().sp... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
l, r = 0, 10 ** 9 + 10
while r - l > 1:
res = 0
m = (l + r) // 2
for x in a:
res += (x - 1) // m
if res <= k:
r = m
else:
l = m
print(r)
| p02598 |
import math
n , k = list(map(int, input().split()))
a = list(map(int,input().split()))
b = [1]*n
for i in range(k):
t = a.index(max(a))
a[t]=a[t]*b[t]/(b[t]+1)
b[t]+=1
print((math.ceil(max(a))))
| import math
n , k = list(map(int, input().split()))
a = list(map(int,input().split()))
left=0
right=max(a)
mid = (left+right)/2
while right - left > 0.5:
times = 0
for i in range(n):
times+=math.ceil(a[i]/mid)-1
if times<=k:
right=mid
mid=(left+right)/2
else:
... | p02598 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.