input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
if N < 11:
d, m = divmod(N, 6)
print((d + (m>0)))
else:
d, m = divmod(N, 11)
a = (1 if m else 0) if m < 7 else 2
print((d * 2 + a)) | N = int(eval(input()))
d, m = divmod(N, 11)
a = (1 if m else 0) if m < 7 else 2
print((d * 2 + a)) | p03817 |
x = int(eval(input()))
if x % 11 == 0:
r = 0
elif x % 11 <= 6:
r = 1
else:
r = 2
ans = 2 * (x // 11) + r
print(ans) | x = int(eval(input()))
ans = 2*(x // 11)
x %= 11
if x == 0:
pass
elif 0 < x <= 6:
ans += 1
elif 6 < x <= 11:
ans += 2
print(ans) | p03817 |
def resolve():
x=int(eval(input()))
q,mod=divmod(x,11)
if mod==0:
print((q*2))
elif 1<=mod<=6:
print(((q+1)*2-1))
else:
print(((q+1)*2))
resolve()
| def resolve():
x=int(eval(input()))
p,mod=divmod(x,11)
if mod==0:
print((p*2))
elif mod<=6:
print(((p+1)*2-1))
else:
print(((p+1)*2))
resolve() | p03817 |
from collections import deque as D
line, stack = D(input().split()), D()
while line:
hoge = line.popleft()
if hoge.isdigit():
stack.append(hoge)
else:
a, b = int(stack.pop()),int(stack.pop())
if hoge =="*":
stack.append(a*b)
elif hoge == "+":
... | s = list(input().split())
a = []
for x in s:
if x in ['+', '-', '*']:
c, b = str(a.pop()), str(a.pop())
b+= x+c
a+=[int(eval(b))]
else:
a+= [int(x)]
print((a.pop()))
| p02263 |
# stack
exp = [i for i in input().split()]
s = []
for lt in exp:
if lt == '+':
rhs = s.pop()
lhs = s.pop()
s.append(lhs + rhs)
elif lt == '*':
rhs = s.pop()
lhs = s.pop()
s.append(lhs * rhs)
elif lt == '-':
rhs = s.pop()
lhs = s... | # stack
exp = input().split()
s = []
for lt in exp:
if lt == '+':
rhs = s.pop()
lhs = s.pop()
s.append(lhs + rhs)
elif lt == '*':
rhs = s.pop()
lhs = s.pop()
s.append(lhs * rhs)
elif lt == '-':
rhs = s.pop()
lhs = s.pop()
... | p02263 |
inputEnzan=input().split()
def keisan(inputEnzan):
while True:
stockFornumber=[]
index=0
length=len(inputEnzan)
if length==1:
break
while index<length:
if inputEnzan[index]=="+" or inputEnzan[index]=="-" or inputEnzan[index]=="*":
... | inputEnzan=input().split()
def keisan(inputEnzan):
while True:
stockFornumber=[]
index=0
length=len(inputEnzan)
if length==1:
break
while index<length:
if inputEnzan[index]=="+" or inputEnzan[index]=="-" or inputEnzan[index]=="*":
... | p02263 |
Sum = input().split()
def mak(che) :
if Sum[che] == '+' :
Sum.insert((che - 2), (int(Sum.pop(che - 2)) + int(Sum.pop(che - 2))))
del Sum[che - 1]
elif Sum[che] == '-' :
Sum.insert((che - 2), (int(Sum.pop(che - 2)) - int(Sum.pop(che - 2))))
del Sum[che - 1]
elif Sum... | Sum = input().split()
cou = 1
while len(Sum) != 1 :
cou += 1
if Sum[cou] == '+' :
del Sum[cou]
Sum.insert((cou - 2) ,int(Sum.pop(cou - 2)) + int(Sum.pop(cou - 2)))
cou -= 2
elif Sum[cou] == '-' :
del Sum[cou]
Sum.insert((cou - 2) ,int(Sum.pop(cou - 2)) - int... | p02263 |
x = input().split()
A = []
for i in x:
try:
A.append(int(i))
except:
b = A.pop()
a = A.pop()
if i == '+':
A.append(a + b)
if i == '-':
A.append(a - b)
if i == '*':
A.append(a * b)
print((A.pop())) | inList = input().split()
stack = []
for i in inList:
if i in ['+', '-', '*']:
b, a = stack.pop(), stack.pop()
if i == '+':
stack.append(b + a)
if i == '-':
stack.append(a - b)
if i == '*':
stack.append(b * a)
else:
stack.app... | p02263 |
import sys
sys.setrecursionlimit(10**9)
def build(t,arr,v,tl,tr):
if tl == tr:
t[v] = arr[tl]
else:
tm = (tl+tr)//2
build(t,arr,2*v,tl,tm)
build(t,arr,2*v+1,tm+1,tr)
t[v] = max(t[2*v],t[2*v+1])
def maxQuery(t,v,tl,tr,l,r):
if l > r:
return 0
... | import sys
sys.setrecursionlimit(10**9)
def build(t,arr,v,tl,tr):
if tl == tr:
t[v] = arr[tl]
else:
tm = (tl+tr)//2
build(t,arr,2*v,tl,tm)
build(t,arr,2*v+1,tm+1,tr)
t[v] = max(t[2*v],t[2*v+1])
def maxQuery(t,v,tl,tr,l,r):
if l > r:
return 0
... | p03176 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
H = list(map(int,readline().split()))
A = list(map(int,readline().split()))
"""
・最後の高さ -> 価値の総和
・BITでmaxを管理
"""
class BIT():
def __init__(self, max_n):
s... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
H = list(map(int,readline().split()))
A = list(map(int,readline().split()))
"""
・最後の高さ -> 価値の総和
・BITでmaxを管理
"""
class BIT():
def __init__(self, max_n):
s... | p03176 |
import sys
input = sys.stdin.readline
#区間の管理は [a, b)で管理していることに注意
# INT_MIN = -10 ** 18
# MAX_N = 4 * 10 ** 5
# MAX_N = 20
# def init(n_):
# #簡単にするために2のべき乗に揃える
# n = 1
# while n <= n_:
# n *= 2
# return n
#初期化
N = int(eval(input()))
# n = 1
# while n <= N:
# n *= 2
... | def main():
import sys
input = sys.stdin.readline
#区間の管理は [a, b)で管理していることに注意
# INT_MIN = -10 ** 18
# MAX_N = 4 * 10 ** 5
# MAX_N = 20
# def init(n_):
# #簡単にするために2のべき乗に揃える
# n = 1
# while n <= n_:
# n *= 2
# return n
#初期化
... | p03176 |
class Max_Bit:
"""区間の最大値のＢＩＴ
viの更新をする。
v1からｖiまでの最大値を取得する。
どちらもO(logn)時間にできる
Attributes:
size (int): BITのサイズ
tree (list of int): 区間の最大値を管理するための二分木
"""
def __init__(self, n):
"""
Args:
n(int): BITのサイズ
"""
self.size =... | class Max_Bit:
"""区間の最大値のＢＩＴ
viの更新をする。
v1からｖiまでの最大値を取得する。
どちらもO(logn)時間にできる
Attributes:
size (int): BITのサイズ
tree (list of int): 区間の最大値を管理するための二分木
"""
def __init__(self, n):
"""
Args:
n(int): BITのサイズ
"""
self.size =... | p03176 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
h = tuple([int(x)-1 for x in input().split()])
a = tuple(map(int,input().split()))
#update(i,x):Aiをxに更新する
def update(i,x):
k = i + num - 1
while k >= 0:
seg[k] = max(x,seg[k])
k = (k-1)//2
#query(a,b,0,0,num):[a,b)の最大値
... | import sys
input = sys.stdin.readline
n = int(eval(input())) + 1
h = list(map(int,input().split()))
a = list(map(int,input().split()))
def init_max(init_max_val):
#set_val
for i in range(n):
seg_max[i+num_max-1]=init_max_val[i]
#built
for i in range(num_max-2,-1,-1) :
... | p03176 |
class SegmentTree:
def __init__(self, array, aggregator):
self.array = array
self.aggregator = aggregator
N = 1
while N < len(array):
N *= 2
self.tree = [0]*(2*N-1)
self.construct_tree(0, len(array)-1, 0)
def construct_tree(self, low, ... |
def update(tree, index, value):
while index < len(tree):
tree[index] = max(tree[index], value)
index += index & -index
def read(tree, index):
value = 0
while index > 0:
value = max(value, tree[index])
index -= index & -index
return value
def read_i... | p03176 |
mod = 10**9+7
class RMQ:
def __init__(self, N):
self.N0 = 2**(N-1).bit_length()
self.INF = float('inf')
self.data = [self.INF]*(2*self.N0)
def update(self, k, x):
k+=self.N0-1
self.data[k] = x
while k>=0:
k = (k-1)//2
self.data[k... | mod = 10**9+7
class SegmentTree:
def __init__(self, N, id, fun):
self.N0 = 2**(N-1).bit_length()
self.id = id
self.data = [self.id]*(2*self.N0)
self.fun = fun
def update(self, k, x):
k+=self.N0-1
self.data[k] = x
while k>=0:
k = (k-1... | p03176 |
# coding: utf-8
import sys
input = sys.stdin.readline
def f3(n, h, a):
dp = [0] * (n + 1)
for i in range(1, n + 1):
hi = h[i]
temp = dp[hi - 1] + a[i]
dp[hi:] = [x if x > temp else temp for x in dp[hi:]]
return(dp[-1])
n = int(eval(input())) # 1 <= n <= 2 x 10^5
h = ... | # coding: utf-8
import sys
input = sys.stdin.readline
def f4(n, h, a):
bit = [0] * (n + 1)
def getmax(h):
x = h - 1
m = 0
while x != 0:
if m < bit[x]:
m = bit[x]
x -= x & -x
return(m)
def update(h, v):
x = ... | p03176 |
def solve(n, hhh, aaa):
n2 = 1 << n.bit_length()
offset = n2 - 1
data = [0] * ((n2 << 1) - 1)
def update(k, x):
i = k + offset
data[i] = max(data[i], x)
while i:
i = (i - 1) // 2
data[i] = max(data[i], x)
def get_max(a, b, i=0, l=0, r=n2)... | def solve(n, hhh, aaa):
n2 = 1 << n.bit_length()
offset = n2 - 1
data = [0] * ((n2 << 1) - 1)
def update(k, x):
i = k + offset
data[i] = max(data[i], x)
while i:
i = (i - 1) // 2
data[i] = max(data[i], x)
def get_max(k):
i = k + ... | p03176 |
def f(n, hs, a_s):
sum_a = [0] * n
sum_a[0] = a_s[0]
for ai, a in enumerate(a_s[1:]):
mx = 0
h = hs[ai + 1]
for i in range(ai + 1):
if h > hs[i]:
if sum_a[i] > mx:
mx = sum_a[i]
sum_a[ai + 1] = a + mx
return sum_a... | def get(i):
mx = 0
while i > 0:
if bit[i] > mx:
mx = bit[i]
i -= i & -i
return mx
def update(i, x):
while i < n + 1:
if x > bit[i]:
bit[i] = x
i += i & -i
n = int(eval(input()))
hs = list(map(int, input().split()))
a_s = list(... | p03176 |
def get(i):
mx = 0
while i > 0:
if bit[i] > mx:
mx = bit[i]
i -= i & -i
return mx
def update(i, x):
while i < n + 1:
if x > bit[i]:
bit[i] = x
i += i & -i
def f(n, hs, a_s):
for h, a in zip(hs, a_s):
update(h, get(... | def get(i):
mx = 0
while i > 0:
if bit[i] > mx:
mx = bit[i]
i -= i & -i
return mx
def update(i, x):
while i < n + 1:
if x > bit[i]:
bit[i] = x
i += i & -i
def f(hs, a_s):
for h, a in zip(hs, a_s):
update(h, get(h -... | p03176 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
class BitMax:
de... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
class BitMax:
de... | p03176 |
class SegTree:
def __init__(self, A, intv, initialize = True):
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.dep = self.N0.bit_length()
if initialize:
self.data = [intv]*(self.N0-1) + A + [intv]*(self.N0 - self.N + 1)
for i in range(se... | class Segtree:
def __init__(self, A, intv, initialize = True, segf = max):
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.intv = intv
self.segf = segf
if initialize:
self.data = [intv]*self.N0 + A + [intv]*(self.N0 - self.N)
for i in... | p03176 |
import math
import sys
input = sys.stdin.readline
# セグメント木のクラス
# 後日遅延評価なども取り入れていきたいが、とりあえず
# 基本的なところだけを分かりやすい形で組んでみたもの
# length:データ部の長さ depth:構造全体の深さ
# offset:上位構造の長さ tree:全体リスト
class Segment_Tree:
# コンストラクタ。リストもしくは要素数にて初期化。
# デフォルトでは最小値を求めるが、op(operation=演算内容、デフォルトは最小値)、
# ie(identity eleme... | class BITmax:
def __init__(self, N, init=0):
self.init = init
self.tree = [self.init] * (N+1)
def set(self, x, value):
while x < N + 1:
old = self.tree[x]
if value <= old:
break
self.tree[x] = value
x += x & ... | p03176 |
INF = 10 ** 9
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from copy import deepcopy
from bisect import bisect_left
class SegmentTree():
def __init__(self,init_val,func,unit): #init_valは長さnの配列 O(2*n)
n = len(init_val)
self.unit = unit #unitは単位元
... | import sys
sys.setrecursionlimit(100000000)
input = sys.stdin.readline
MOD = 10 ** 9 + 7
class SegmentTree():
f = max
unit = 0
def __init__(self,array):
self.N = len(array)
self.tree = [self.unit] * (2*self.N)
#self._build(array)
def _build(self,array):
... | p03176 |
def solve(n, h, a):
size = 1 << ((n + 1) - 1).bit_length() # 元の配列サイズ以上の最小の二冪 == 最下段
# 高さに対する美しさの最大値なので、高さ[0,n]の(n+1)要素に対して、segを考える
seg = [0] * (size * 2 - 1)
def update(seg, k, x):
k += size - 1
seg[k] = x # 値を更新する
while k > 0:
k = (k - 1) // 2 # 親のindex
... | def solve(n, h, a):
size = 1 << ((n + 1) - 1).bit_length() # 元の配列サイズ以上の最小の二冪 == 最下段
# 高さに対する美しさの最大値なので、高さ[0,n]の(n+1)要素に対して、segを考える
seg = [0] * (size * 2 - 1)
def update(seg, k, x):
k += size - 1
seg[k] = x # 値を更新する
while k > 0:
k = (k - 1) // 2 # 親のindex
... | p03176 |
n = int(eval(input()))
h = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
class Bucket:
def __init__(self, a, k, func=max, one=-10**18):
self.n = len(a)
self.k = k
self.func = func
self.one = one
self.a = a[:]
self.b = []
... | n = int(eval(input()))
h = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
class Bucket:
def __init__(self, a, k, func=max, one=-10**18):
self.n = len(a)
self.k = k
self.func = func
self.one = one
self.a = a[:]
self.b = []
... | p03176 |
n = int(eval(input()))
h = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
class Bucket:
def __init__(self, a, k, func=max, one=-10**18):
self.n = len(a)
self.k = k
self.func = func
self.one = one
self.a = a[:]
self.b = []
... | n = int(eval(input()))
h = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
class SegmentTree:
def __init__(self, a, func=max, one=-10 ** 18):
self.logn = (len(a) - 1).bit_length()
self.n = 1 << self.logn
self.func = func
self.one = one
s... | p03176 |
# -*- coding: utf-8 -*-
def main():
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range... | # -*- coding: utf-8 -*-
def main():
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def query(i):
... | p03176 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**9)
def main():
N = int(eval(input()))
h = list(map(int,input().split()))
a = list(map(int,input().split()))
def segfunc(x,y):
return max(x,y)
def update(k,x):
k += num-1
seg[... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**9)
def main():
N = int(eval(input()))
h = list(map(int,input().split()))
a = list(map(int,input().split()))
def segfunc(x,y):
return max(x,y)
def update(k,x):
k += num-1
seg[... | p03176 |
# EDPC Q - Flowers
# 重み付きのLISと言って良いような問題
# これは、LISのdpを少し改造すれば解ける
# import numpy as np
## test data
# 4
# 3 1 4 2
# 10 20 30 40
## ans=60
# import bisect
class SegTree:
def __init__(self,size,func,init_val,undef):
self.specSize = size
self.datSize = 1
self.compareFunc = func # suppose to ... |
# EDPC Q - Flowers
# 重み付きのLISと言って良いような問題
# これは、LISのdpを少し改造すれば解ける
# import numpy as np
## test data
# 4
# 3 1 4 2
# 10 20 30 40
## ans=60
# import bisect
class BIT:
def __init__(self,size):
self.N = size
self.bit = [0] * (self.N+1)
def getSum(self,i):
s = 0
while 0 < i:
s +=... | p03176 |
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
class Node:
def __init__(self,s,e):
self.start=s
self.end=e
self.val = 0
self.left=None
self.right=None
def build(nums,l,r):
if l == r:
temp = Node(l,l)
temp.val =... | from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop,heapify
import math
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
from itertools import accumulate
from functools import lru_cache
M = mod... | p03176 |
N = int(eval(input()))
H = list(map(int,input().split()))
A = list(map(int,input().split()))
class SegTreeMax:
def __init__(self,arr):
n = 1
while n < len(arr):
n *= 2
self.n = n
nodes = [0]*(2*n-1)
nodes[n-1:n-1+len(arr)] = arr
for i in range... | N = int(eval(input()))
H = list(map(int,input().split()))
A = list(map(int,input().split()))
class SegTreeMax:
def __init__(self,arr):
n = 1
while n < len(arr):
n *= 2
self.n = n
nodes = [0]*(2*n-1)
nodes[n-1:n-1+len(arr)] = arr
for i in range... | p03176 |
import operator
class SegmentTree:
def __init__(self, seq, op=operator.add):
self.n = len(seq)
self.op = op
self.tree = [-1] * self.n + seq
for i in reversed(list(range(1, self.n))):
self.tree[i] = op(self.tree[2*i], self.tree[2*i+1])
def modify(self, po... | import operator
class SegmentTree:
def __init__(self, seq, op=operator.add):
self.n = len(seq)
self.op = op
self.tree = [-1] * self.n + seq
for i in reversed(list(range(1, self.n))):
self.tree[i] = op(self.tree[2*i], self.tree[2*i+1])
def modify(self, po... | p03176 |
import operator
class SegmentTree:
def __init__(self, seq, op=operator.add):
self.n = len(seq)
self.op = op
self.tree = [-1] * self.n + seq
for i in reversed(list(range(1, self.n))):
self.tree[i] = op(self.tree[2*i], self.tree[2*i+1])
def modify(self, po... | import operator
class SegmentTree:
__slots__ = ('n', 'op', 'tree')
def __init__(self, seq, op=operator.add):
self.n = len(seq)
self.op = op
self.tree = [-1] * self.n + seq
for i in reversed(list(range(1, self.n))):
self.tree[i] = op(self.tree[2*i], self.... | p03176 |
class SegmentTree:
__slots__ = ('n', 'op', 'tree')
def __init__(self, seq, op=max):
self.n = len(seq)
self.op = op
self.tree = [-1] * self.n + seq
for i in reversed(list(range(1, self.n))):
self.tree[i] = op(self.tree[2*i], self.tree[2*i+1])
def modify... | class SegmentTree:
__slots__ = ('n', 'op', 'tree')
def __init__(self, seq, op=max):
self.n = len(seq)
self.op = op
self.tree = [-1] * (2 * self.n)
for i in range(self.n):
self.tree[i+self.n] = seq[i]
for i in reversed(list(range(1, self.n))):
... | p03176 |
class SegmentTree:
__slots__ = ('n', 'op', 'tree')
def __init__(self, seq, op=max):
self.n = len(seq)
self.op = op
self.tree = [-1] * (2 * self.n)
for i in range(self.n):
self.tree[i+self.n] = seq[i]
for i in reversed(list(range(1, self.n))):
... | class SegmentTree:
def __init__(self, n):
self.tree = [0] * (2 * n)
self.n = n
def modify(self, pos, val):
tree = self.tree
pos += self.n
tree[pos] = val
while pos > 1:
tree[pos//2] = max(tree[pos], tree[pos ^ 1])
pos //= 2
... | p03176 |
N = int(eval(input()))
h = list(map(int, input().split()))
a = list(map(int, input().split()))
def base10to(n, b):
if b <= n:
return base10to(n//b, b) + str(n%b)
return str(n%b)
num = 2**(len(base10to(N+1,2))+1)
seg = [0]*(2*num-1)
#update(i,x):Aiをxに更新する
def update(i,x):
k = i + num... | N = int(eval(input()))
h = list(map(int, input().split()))
a = list(map(int, input().split()))
num = 2
while num <= N+1:
num *= 2
seg = [0]*(2*num-1)
#update(i,x):Aiをxに更新する
def update(i,x):
k = i + num - 1
while k >= 0:
seg[k] = max(x,seg[k])
k = (k-1)//2
#query(a,b,0,0,... | p03176 |
def init(init_val):
for i in range(n):
MI[i+num-1] = init_val[i]
MA[i+num-1] = init_val[i]
for i in range(num-2, -1, -1):
MI[i] = min(MI[2*i+1], MI[2*i+2])
MA[i] = max(MA[2*i+1], MA[2*i+2])
def update(k, x):
k += num-1
MI[k] = x
MA[k] = x
while k+1:... | class SegmentTree: # 0-indexed
def __init__(self, array, operation=min, identity=10**30):
self.identity = identity
self.n = len(array)
self.N = 1 << (self.n - 1).bit_length()
self.tree = [self.identity] * 2 * self.N
self.opr = operation
for i in range(self.n):... | p03176 |
while True:
n,k = list(map(int, input().split()))
if n == k == 0:
break
s = [int(x) for x in input().split()]
for _ in range(n):
b = [int(x) for x in input().split()]
for i in range(k):
s[i] -= b[i]
print(("Yes" if min(s) >= 0 else "No")) | while True:
n,k = list(map(int, input().split()))
if n == k == 0:
break
s = list(map(int, input().split()))
for _ in range(n):
b = list(map(int, input().split()))
for i in range(k):
s[i] -= b[i]
print(("Yes" if min(s) >= 0 else "No")) | p00605 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
As = list(mapint())
Bs = list(mapint())
if sum(As)<sum(Bs):
print((-1))
else:
diff = [a-b for a, b in zip(As, Bs)]
diff.sort()
... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
As = list(mapint())
Bs = list(mapint())
if sum(As)<sum(Bs):
print((-1))
else:
minus = 0
cnt = 0
lis = []
for a, b in z... | p03151 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
res = 0
if sum(a) < sum(b):
res = -1
else:
c = [a[i] - b[i] for i in range(n)]
c1 = [i if i > 0 else 0 for i in c]
c2 = sum([i if i < 0 else 0 for i in c])
c3 = sum([1 if i < 0 else 0 for i in ... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
res = 0
d = 0
if sum(a) < sum(b):
res = -1
else:
c = [a[i] - b[i] for i in range(n)]
c1 = [i if i > 0 else 0 for i in c]
c2 = sum([i if i < 0 else 0 for i in c])
c3 = sum([1 if i < 0 else 0 fo... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_origin = A[:]
if sum(A) < sum(B):
print((-1))
exit()
diff = [[i, a - b] for i, a, b in zip(list(range(N)), A, B)]
order = sorted([[i, x] for i, x in diff if x > 0], key=lambda d: d[1])
C = []
cha... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 各テストの余裕を小さい順に
margins = [[i, a - b] for i, (a, b) in enumerate(zip(A, B)) if (a - b) > 0]
margins.sort(key=lambda m: m[1])
# 調整済みA
X = A[:]
# 余裕が大きい方から使っていく
for i in range(N):
while (A[i] < B[i]) and m... | p03151 |
from itertools import accumulate
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
surplus = [(a - b) for a, b in zip(A, B) if (a - b) > 0]
surplus.sort(reverse=True)
surplus_acc = [0] + list(accumulate(surplus))
short = [(b - a) for a, b in zip(A, B) if (b - a)... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A) < sum(B):
print((-1))
exit()
surpluses = sorted([a - b for a, b in zip(A, B) if a - b > 0])
need = [b - a for a, b in zip(A, B) if b - a > 0]
need_sum = sum(need)
ans = len(need)
tmp = 0
... | p03151 |
# keyence2019C - Exam and Wizard
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
dif = sorted(i - j for i, j in zip(A, B))
ans, shortage = 0, 0
for i in dif:
if i < 0:
ans += 1
shortage += i
... | # keyence2019C - Exam and Wizard
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
pos, neg = [], []
for i, j in zip(A, B):
x = i - j
if x >= 0:
pos += [x]
else:
neg += [x]
ans,... | p03151 |
def main():
n = int(eval(input()))
a = input_list()
b = input_list()
c = [a[i] - b[i] for i in range(n)]
s = sum(c)
if s < 0:
print((-1))
exit(0)
c.sort()
ans = 0
for i in range(n):
if c[i] < 0:
pass
elif c[i] <= s:
ans += 1
s -= c[i]
else:
... | def main():
n = int(eval(input()))
A = input_list()
B = input_list()
C = [A[i] - B[i] for i in range(n)]
s = sum(C)
if s < 0:
print((-1))
exit()
C.sort()
ans = 0
for i in range(n):
if C[i] < 0:
continue
elif C[i] <= s:
... | p03151 |
from itertools import accumulate
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if sum(a)<sum(b):
print((-1))
exit()
c=[]
lack=0
cnt=0
for i,j in zip(a,b):
t=i-j
if i-j>=0:
c.append(t)
else:
lack+=abs(t)
cnt+=1
if cnt==0:
print((0))... | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(eval(input()))
a=lnii()
b=lnii()
plus=[]
minus=0
ans=0
for i in range(n):
if a[i]<b[i]:
minus+=b[i]-a[i]
ans+=1
else:
plus.append(a[i]-b[i])
if minus==0... | p03151 |
n = int(eval(input()))
a_list = list(map(int,input().split()))
b_list = list(map(int,input().split()))
if sum(a_list)<sum(b_list):
print((-1))
else:
diff_list = [a_list[i]-b_list[i] for i in range(n)]
cnt=0
for diff in diff_list:
if diff<0:
cnt+=1
while min(diff_list)<... | n = int(eval(input()))
a_list = list(map(int,input().split()))
b_list = list(map(int,input().split()))
if sum(a_list)<sum(b_list):
print((-1))
else:
diff_list = [a_list[i]-b_list[i] for i in range(n)]
posi_list=[]
cnt,diff_sum = 0,0
for diff in diff_list:
if diff<0:
cn... | p03151 |
from bisect import bisect_right
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if sum(a) == sum(b):
print(n)
mp = 0
ans = 0
l = []
for i in range(n):
if a[i] < b[i]:
mp -= b[i] - a[i]
elif a[i] >= b[i]:
mp += a[i] - b[i]
l... | n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if sum(a)<sum(b):
print((-1))
exit(0)
t=sum(a)-sum(b)
l=[]
for i in range(n):
if a[i] >= b[i]:
l.append(a[i]-b[i])
l.sort()
ans=0
for x in l:
t-=x
if t<0:
break
ans+=1
print((n-ans)) | p03151 |
N=eval(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
unmatch=[]
need=0
for i in range(N):
if A[i]<B[i]:
unmatch.append(i)
need+=B[i]-A[i]
Gap=[A[i]-B[i] for i in range(N) if i not in unmatch]
Gap.sort(reverse=True)
Ans=len(unmatch)
while need>0:
if... | N=eval(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
need=0
Ans=0
for a,b in zip(A,B):
if b>a:
need+=b-a
Ans+=1
index=0
Gap=[a-b for a,b in zip(A,B)]
Gap.sort(reverse=True)
while need>0:
if Ans+index>=N:
break
need-=Gap[inde... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A) < sum(B):
print((-1))
else:
before = [A[i] - B[i] for i in range(N)]
before.sort()
diff = [A[i] - B[i] for i in range(N)]
# print(diff)
diff.sort()
left = 0
right = N - ... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A) < sum(B):
print((-1))
else:
before = [A[i] - B[i] for i in range(N)]
before.sort()
diff = [A[i] - B[i] for i in range(N)]
# print(diff)
diff.sort()
left = 0
right = N - ... | p03151 |
N = int(eval(input()))
A = []
l1 = input().split()
for i in l1:
A.append(int(i))
B = []
l2 = input().split()
for i in l2:
B.append(int(i))
if sum(A) < sum(B):
print((-1))
else:
z = 0
ar1 = []
ar2 = []
for i in range(N):
if A[i] < B[i] :
ar1.append(B[i] -... | N = int(eval(input()))
A = []
l1 = input().split()
for i in l1:
A.append(int(i))
B = []
l2 = input().split()
for i in l2:
B.append(int(i))
if sum(A) < sum(B):
print((-1))
else:
z = 0
ar1 = []
ar2 = []
for i in range(N):
if A[i] < B[i] :
ar1.append(B[i] -... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(B) > sum(A):
print("-1")
exit()
D = []
for i in range(N):
D.append(A[i]-B[i])
D.sort()
#print(D)
num = 0
s = 0; t = -1
yoyu = 0
while D[s] < 0:
if yoyu+D[s] <0:
num += 1 #ここで一番余裕があるのを取り出す。
... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(B)>sum(A):
print((-1))
exit()
amari = []
fusoku = []
for i in range(N):
if A[i] < B[i]:
fusoku.append(B[i]-A[i])
elif A[i] > B[i]:
amari.append(A[i]-B[i])
amari.sort(reverse=True)
ans = ... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
K = 0
S = 0
T = []
if sum(A) < sum(B):
print('-1')
else:
for i in range(N):
if A[i] < B[i]:
K += 1
S = S + B[i] - A[i]
elif A[i] > B[i]:
T.append(A[i] ... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
K = 0
S = 0
T = []
if sum(A) < sum(B):
K = -1
else:
for i in range(N):
if A[i] < B[i]:
K += 1
S = S + B[i] - A[i]
elif A[i] > B[i]:
T.append(A[i] - B[i... | p03151 |
# -*- coding: utf-8 -*-
def main():
from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
plus = list()
minus = list()
for ai, bi in zip(a, b):
diff = ai - bi
if diff > 0:
... | # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if sum(a) < sum(b):
print((-1))
else:
c = [a[i] - b[i] for i in range(n)]
minus = [ci for ci in c if ci < 0]
plus = sorte... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = [A[i] - B[i] for i in range(0,N)]
C.sort()
p = 0
ans = 0
for i in range(0,N):
if C[i] < 0:
p += C[i]
ans += 1
else:
break
if p < 0:
for j in range(N - 1,0,-1):
if C[j] > 0:
... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = [A[i] - B[i] for i in range(0,N)]
C.sort()
p = 0
ans = 0
j = len(A) - 1
for i in range(0,N):
if C[i] < 0:
p += C[i]
ans += 1
else:
break
if p < 0:
if C[j] > 0:
p += C[j]
an... | p03151 |
n = int(eval(input()))
score = list(map(int, input().split()))
sum_score = sum(score)
target = list(map(int, input().split()))
sum_target = sum(target)
sub = list([score[x] - target[x] for x in range(n)])
cnt = sum(1 for x in sub if x < 0)
sub.sort()
sub.reverse()
sub_new = [0]
for i in range(n):
sub_n... | n = int(eval(input()))
score = list(map(int, input().split()))
target = list(map(int, input().split()))
sub = [score[i] - target[i] for i in range(n)]
ans = 0
if sum(score) < sum(target): ans = -1
else:
minus = []
plus = []
for i in range(n):
if(sub[i] < 0): minus.append(-sub[i])
... | p03151 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
plus = []
minus = []
for i in range(n):
diff = a[i] - b[i]
if diff >= 0:
plus.append(diff)
else:
minus.append((-1) * diff)
plus.sort(reverse=True)
plus = collections... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
plus = []
total_minus = 0
for i in range(n):
diff = a[i] - b[i]
if diff >= 0:
plus.append(diff)
else:
total_minus += (-1) * diff
plus.sort(reverse=True)
if total_minus == 0:
print(... | p03151 |
import bisect
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = sorted([A[i] - B[i] for i in range(N)])
if sum(C) < 0:
print((-1))
elif min(C) >= 0:
print((0))
else:
D = sorted([i for i in C if i > 0], reverse=True)
r = [D[0]]
for i in ran... | import bisect
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = sorted([A[i] - B[i] for i in range(N)])
if sum(C) < 0:
print((-1))
elif min(C) >= 0:
print((0))
else:
D = [i for i in C if i < 0]
m = sum(D)
for i in range(N-1,-1,-1):
... | p03151 |
N=int(eval(input()))
*A, = list(map(int,input().split()))
*B, = list(map(int,input().split()))
D = sorted(a-B[i] for i,a in enumerate(A))
S = 0
for ans,d in enumerate(D):
if d>=0:break
S += d
if S==0:ans = -1
for i,d in enumerate(D[::-1],1):
S += d
if S>=0:break
ans = (-1) if S<0 else (ans+i... | N=int(eval(input()))
*A,=list(map(int,input().split()))
*B,=list(map(int,input().split()))
C = sorted(a-b for a,b in zip(A,B))
ans = 0
S = 0
for c in C:
if c>=0:break
S += c
ans += 1
for c in C[::-1]:
if c<=0:break
if S>=0:break
S+=c
ans += 1
if S<0:ans=-1
print(ans) | p03151 |
#!/usr/bin/env python3
# from numba import njit
# input = stdin.readline
# @njit
def solve(n,a,b):
delta = [b[i] - a[i] for i in range(n)]
need = list(sorted(x for x in delta if x > 0))
amari = list(sorted((abs(x) for x in delta if x < 0),reverse=True))
if sum(need) > sum(amari):
return -1
... | #!/usr/bin/env python3
# from numba import njit
# input = stdin.readline
# @njit
def solve(n,a,b):
delta = [b[i] - a[i] for i in range(n)]
need = list(x for x in delta if x > 0)
amari = list(sorted((abs(x) for x in delta if x < 0),reverse=True))
needScore = sum(need)
if needScore > sum(amari):
... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Cm = []
Cp = []
for i in range(N):
if(A[i]-B[i]<0):
Cm.append(A[i]-B[i])
elif(A[i]-B[i]>0):
Cp.append(A[i]-B[i])
Cm.sort()
Cp.sort()
cnt = 0
nowCp = 0
j = 0
for i in range(len(Cp)):
if(sum(Cp)<abs(s... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Cm = []
Cp = []
for i in range(N):
if(A[i]-B[i]<0):
Cm.append(A[i]-B[i])
elif(A[i]-B[i]>0):
Cp.append(A[i]-B[i])
Cm.sort()
Cp.sort()
if(len(Cm) == 0):
print((0))
exit(0)
if(sum(Cp)<abs(sum(Cm))):
pr... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = -1
not_enough = []
enough = []
for i in range(N):
if A[i] - B[i] < 0:
not_enough.insert(0, abs(A[i] - B[i]))
else:
enough.insert(0, abs(A[i] - B[i]))
enough.sort()
enough.reve... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = -1
not_enough = []
enough = []
for i in range(N):
if A[i] - B[i] < 0:
not_enough.append(abs(A[i] - B[i]))
else:
enough.append(A[i] - B[i])
enough.sort()
enough.reverse()
#p... | p03151 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=[]
SA=sum(A)
SB=sum(B)
S=SA-SB
cnt=0
if SB>SA:
print((-1))
exit()
for a,b in zip(A,B):
if a>b:
C.append(a-b)
elif a==b:
cnt+=1
for c in sorted(set(C)):
if S>=C.count(c)*c:
... | N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=[]
SA=sum(A)
SB=sum(B)
S=SA-SB
cnt=0
ns=0
if SB>SA:
print((-1))
exit()
for a,b in zip(A,B):
if a>b:
C.append(a-b)
elif a<b:
ns+=b-a
cnt+=1
C.sort(reverse=True)
for i in ran... | p03151 |
n = int(eval(input()))
As = [int(i) for i in input().split()]
Bs = [int(i) for i in input().split()]
ABs = sorted([a - b for a, b in zip(As, Bs)])
# print(As, Bs, ABs)
if sum(As) < sum(Bs):
print((-1))
exit()
if min(ABs) > 0:
print((-1))
exit()
mABs = [ab for ab in ABs if ab < 0]
msum, ans =... | n = int(eval(input()))
As = [int(i) for i in input().split()]
Bs = [int(i) for i in input().split()]
ABs = [a - b for a, b in zip(As, Bs)]
if sum(As) < sum(Bs) or min(ABs) > 0:
print((-1))
exit()
mABs = [ab for ab in ABs if ab < 0]
pABs = [ab for ab in ABs if ab > 0]
ans, t = len(mABs), sum(mABs)
for ... | p03151 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = sorted([a[i] - b[i] for i in range(n)])
k = sum(x < 0 for x in c)
if sum(c) < 0:
print((-1))
elif k == 0:
print((0))
else:
for i in range(n):
if sum(c[len(c) - 1 - i:]) >= -sum(c[:k]):
print(... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = sorted([a[i] - b[i] for i in range(n)])
k = sum(x < 0 for x in c)
neg = -sum(c[:k])
pos = c[len(c) - 1]
if sum(c) < 0:
print((-1))
elif k == 0:
print((0))
else:
for i in range(n):
if pos >= neg:
... | p03151 |
n = int(eval(input()))
a = [int(x) for x in input().split(' ')]
b = [int(x) for x in input().split(' ')]
if sum(a) < sum(b):
print('-1')
exit()
count = 0
sabun = [(i, a[i]-b[i]) for i, _ in enumerate(a) if a[i]<b[i]]
husoku = sum([x[1] for x in sabun])
a_sorted = sorted(a)
while husoku < 0:
... | n = int(eval(input()))
a = [int(x) for x in input().split(' ')]
b = [int(x) for x in input().split(' ')]
if sum(a) < sum(b):
print('-1')
exit()
count = 0
sabun = [a[i]-b[i] for i, _ in enumerate(a)]
husoku = sum([x for x in sabun if x<0])
sabun.sort(reverse=True)
for i in sabun:
if husoku... | p03151 |
import sys
input = sys.stdin.readline
from bisect import insort_left
def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
if sum(A) < sum(B):
print((-1))
exit()
ok = []
ng_cnt = 0
ng_num = 0
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
from bisect import insort_left
def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
if sum(A) < sum(B):
print((-1))
exit()
ok = []
... | p03151 |
N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
d_pls = []
d_mns = []
s = 0
for i in range(N):
t = a[i] - b[i]
s += t
if t > 0:
d_pls.append(t)
elif t < 0:
d_mns.append(t)
# 準備不足なら負
if s < 0:
print((-1))
exit()
... | N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
d = list(aa - bb for aa, bb in zip(a, b))
d = sorted(d)
p = tuple([x for x in d if x >= 0])
p = sorted(p, reverse=True)
m = tuple([x for x in d if x < 0])
s = sum(m)
i = 0
while s < 0 and i < len(p):
s ... | p03151 |
# -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect i... | # -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect i... | p03151 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt, nega, posi = 0, 0, []
for x, y in zip(a, b):
if x < y:
nega += y - x
cnt += 1
else:
posi.append(x - y)
if nega > 0:
posi.sort(reverse=True)
for i, x in enumerate(posi):... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt, nega, posi = 0, 0, []
for x, y in zip(a, b):
if x < y:
nega += y - x
cnt += 1
else:
posi.append(x - y)
if sum(posi) - neg... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(A) < sum(B):
print((-1))
exit(0)
t = 0
m = 0
L = []
for k in range(N):
if A[k] > B[k]:
L.append(A[k]-B[k])
else:
m += B[k] - A[k]
t += 1
if m == 0:
print(... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(A) < sum(B):
print((-1))
exit(0)
C = [A[k]-B[k] for k in range(N)]
C.sort()
t = 0
ans = 0
for k in range(N):
if C[k] >= 0:
break
else:
t -= C[k]
ans += 1
for k ... | p03151 |
n=int(eval(input()))
Alist=[int(i) for i in input().split(" ")]
Blist=[int(i) for i in input().split(" ")]
sumA=sum(Alist)
sumB=sum(Blist)
Dlist=[]
muinus=0
muinus_num=0
count=0
if sumA<sumB:
print((-1))
else:
for i in range(n):
AB=Alist[i]-Blist[i]
Dlist.append(AB)
if AB<... | n=int(eval(input()))
Alist=[int(i) for i in input().split(" ")]
Blist=[int(i) for i in input().split(" ")]
sumA=sum(Alist)
sumB=sum(Blist)
Dlist=[]
muinus=0
muinus_num=0
count=0
if sumA<sumB:
print((-1))
else:
for i in range(n):
AB=Alist[i]-Blist[i]
Dlist.append(AB)
if AB<... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
diff = [a - b for a, b in zip(A, B)]
upper = sorted([x for x in diff if x > 0])
lower = sorted([x for x in diff if x < 0], reverse=True)
ans = N - len([x for x in diff if x == 0])
while upper and lower:
rest = upp... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
diff = [a - b for a, b in zip(A, B)]
upper = sorted([x for x in diff if x > 0])
lower = sorted([x for x in diff if x < 0])
ans = N - len([x for x in diff if x == 0])
while upper and lower:
rest = upper.pop()
... | p03151 |
def main():
n = int(eval(input()))
As = list(map(int, input().split()))
Bs = list(map(int, input().split()))
diffs = [a - b for a, b in zip(As, Bs)]
positives = list(sorted([x for x in diffs if x>0], reverse=True))
negatives = list(sorted([x for x in diffs if x<0]))
if abs(sum(negatives)) > sum(p... | from itertools import accumulate
def main():
n = int(eval(input()))
As = list(map(int, input().split()))
Bs = list(map(int, input().split()))
diffs = [a - b for a, b in zip(As, Bs)]
pos_acc = list(accumulate(sorted([x for x in diffs if x>0], reverse=True)))
negatives = list([x for x in diffs if... | p03151 |
import sys
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
AB = list(zip(A, B))
bigger_diff = list([max(ab[0] - ab[1], 0) for ab in AB])
lesser_diff = list([min(ab[0] - ab[1], 0) for ab in AB])
exceeded = sum(bigger_diff)
... | import sys
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
AB = list(zip(A, B))
bigger_diff = list([max(ab[0] - ab[1], 0) for ab in AB])
lesser_diff = list([min(ab[0] - ab[1], 0) for ab in AB])
exceeded = sum(bigger_diff)
... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = sorted([A[i]-B[i] for i in range(N)])
tot = sum(C)
cnt = 0
if tot<0:
cnt = -1
else:
a = 0
for i in range(N):
if C[i]<0:
a += C[i]
cnt += 1
else:
... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
P = sorted([A[i]-B[i] for i in range(N) if A[i]-B[i]>0],reverse=True)
C = [0 for _ in range(N+1)]
for i in range(1,len(P)+1):
C[i] = C[i-1]+P[i-1]
M = [B[i]-A[i] for i in range(N) if B[i]-A[i]>0]
p = sum(P)
m = sum... | p03151 |
import copy
siken_kazu=int(eval(input()))
junbido=[int(i) for i in input().split(" ")]
goukakudo=[int(i) for i in input().split(" ")]
yoyudo=[junbido[i]-goukakudo[i] for i in range(siken_kazu)]
shoki_yoyudo=copy.deepcopy(yoyudo)
k=0
hantei=2
if sum(junbido)<sum(goukakudo):
k=-1
elif min(yoyudo)>=0:
p... | import copy
siken_kazu=int(eval(input()))
junbido=[int(i) for i in input().split(" ")]
goukakudo=[int(i) for i in input().split(" ")]
yoyudo=[junbido[i]-goukakudo[i] for i in range(siken_kazu)]
counter=0
shakkin=0
tyokin=0
if sum(junbido)<sum(goukakudo):
counter=-1
else:
for i in yoyudo:
if ... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split(' ')))
B = list(map(int, input().split(' ')))
sum_A = sum(A)
sum_B = sum(B)
diff = []
neg = 0
count = 0
if sum_B > sum_A:
print((-1))
exit()
for a, b in zip(A, B):
diff += [a-b]
if a < b:
count += 1
neg += a - ... | N = int(eval(input()))
A = list(map(int, input().split(' ')))
B = list(map(int, input().split(' ')))
diff = []
neg = 0
count = 0
if sum(B) > sum(A):
print((-1))
exit()
for a, b in zip(A, B):
diff += [a-b]
if a < b:
count += 1
neg += a - b
for d in sorted(diff, reve... | p03151 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
surplus = []
short = []
for i in range(n):
if a[i] > b[i]:
surplus.append(a[i]-b[i])
elif b[i] > a[i]:
short.append(b[i]-a[i])
surplus = sorted(surplus)
taken = False
cnt = 0
for i i... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
surplus = []
short = 0
cnt = 0
for i in range(n):
if a[i] > b[i]:
surplus.append(a[i]-b[i])
elif b[i] > a[i]:
short += b[i]-a[i]
cnt += 1
surplus = sorted(surplus)
s = 0
w... | p03151 |
N= int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
short = []
margine = []
for a,b in zip(A,B):
if a > b :
margine.append(a-b)
elif b > a:
short.append(b-a)
ss = sum(short)
sc = len(short)
margine.sort()
if sum(short)>sum(margine)... | N= int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
short = []
margine = []
for a,b in zip(A,B):
if a > b :
margine.append(a-b)
elif b > a:
short.append(b-a)
ss = sum(short)
sc = len(short)
margine.sort()
if ss>sum(margine):
p... | p03151 |
from bisect import bisect_left
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
surplus = []
need = 0
ans = 0
for a, b in zip(A, B):
diff = a - b
if diff > 0:
surplus.append(diff)
... | from bisect import bisect_left
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
surplus = []
need = 0
ans = 0
for a, b in zip(A, B):
diff = a - b
if diff >= 0:
surplus.append(diff)
... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(A) < sum(B):
print((-1))
exit()
if all(a>=b for a,b in zip(A,B)):
print((0))
exit()
lack_v = lack_n = 0
gains = []
for a,b in zip(A,B):
if a<b:
lack_n += 1
lack_v += ... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
D = [a-b for a,b in zip(A,B)]
D.sort()
lack = sum(d for d in D if d<0)
ans = 0
for d in D[::-1]:
if lack < 0 and d > 0:
ans += 1
lack += d
if d < 0:
ans += 1
print((-1 if lack < ... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(B) > sum(A):
print((-1))
else:
diff = [a-b for a,b in zip(A,B)]
plus = []
minus = []
equal = []
for d in diff:
if d >= 0:
plus.append(d)
elif d < 0:
... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(B) > sum(A):
print((-1))
else:
diff = [a-b for a,b in zip(A,B)]
plus = []
minus_num = 0
lack = 0
for d in diff:
if d >= 0:
plus.append(d)
elif d < 0:
... | p03151 |
N=int(eval(input()))
A=[int(i) for i in input().split()]
B=[int(i) for i in input().split()]
count=0
if sum(A)<sum(B):
print((-1))
else:
dif=[A[i]-B[i] for i in range(N)]
if min(dif)>=0:
print((0))
else:
difsort=sorted(dif)
pluslist=[i for i in difsort if i>=0]
... | N=int(eval(input()))
A=[int(i) for i in input().split()]
B=[int(i) for i in input().split()]
count=0
if sum(A)<sum(B):
print((-1))
else:
dif=[A[i]-B[i] for i in range(N)]
if min(dif)>=0:
print((0))
else:
difsort=sorted(dif)
plist=[i for i in difsort if i>=0][::-1]
... | p03151 |
import sys
N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if sum(A)<=sum(B):
print((-1))
sys.exit()
Y=0
K=0
Q=[]
for i in range(N):
k=A[i]-B[i]
if k>0:
Q.append(k)
elif k<0:
K+=1
Y+=-k
Q.sort(reverse=True)
... | import sys
N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if sum(A)<=sum(B):
print((-1))
sys.exit()
Y=0
K=0
Q=[]
for i in range(N):
k=A[i]-B[i]
if k>0:
Q.append(k)
elif k<0:
K+=1
Y+=-k
Q.sort()
while Y>0:
... | p03151 |
import sys
input=sys.stdin.readline
mii=lambda:list(map(int,input().split()))
n=int(eval(input()))
a=list(mii())
b=list(mii())
k = []
j = 0
na= 0
c = 0
for i in range(n):
if a[i]<b[i]:
na +=b[i]-a[i]
c+=1
elif a[i] > b[i]:
k.append(a[i]-b[i])
k.sort()
while na > 0 ... | import sys
input=sys.stdin.readline
mii=lambda:list(map(int,input().split()))
n=int(eval(input()))
a=list(mii())
b=list(mii())
k = []
j = 0
na= 0
c = 0
for i in range(n):
if a[i]<b[i]:
na +=b[i]-a[i]
c+=1
elif a[i] > b[i]:
k.append(a[i]-b[i])
k.sort()
while na > 0 and ... | p03151 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
diff = [0] * (N)
diffsum = 0
for i in range(N):
diff[i] = A[i] - B[i]
diffsum += diff[i]
if diffsum < 0:
print("-1")
exit()
diff.sort()
change = [0] * (N)
for i in range(N):
if diff[i] < 0:... | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
diff = [0] * (N)
diffsum = 0
for i in range(N):
diff[i] = A[i] - B[i]
diffsum += diff[i]
if diffsum < 0:
print("-1")
exit()
diff.sort()
count = 0
sumn = 0
for i in range(N):
if diff[i] < 0... | p03151 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
L = [A[i] - B[i] for i in range(N)]
ans = 0
if sum(A) < sum(B) :
ans = -1
else :
debt = []
deposit = []
for i in range(N) :
if L[i] < 0 :
debt.append(-L[i])
elif L[i] >... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
L = [A[i] - B[i] for i in range(N)]
ans = 0
if sum(A) < sum(B) :
ans = -1
else :
debt = []
deposit = []
for i in range(N) :
if L[i] < 0 :
debt.append(-L[i])
eli... | p03151 |
N = int(eval(input()))
A = sorted(list(map(int,input().split())))
B =list(map(int,input().split()))
if(sum(A) < sum(B)):
print((-1))
exit()
cnt = 0
for i in range(N):
if(A[i] >= B[i]):
cnt += 1
if(cnt == N):
print((0))
exit()
C = []
tmp = []
for b in B:
for a in A:
if(a not in tmp):... | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if(sum(A) < sum(B)):
print((-1))
else:
C = [A[i] - B[i] for i in range(N)]
D = sorted([c for c in C if c > 0])
E = [c for c in C if c < 0]
ans = 0
num = sum(E)
while num < 0:
num += D.pop()
an... | p03151 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
surplus_scores = []
sum_lack_score = 0
ans = 0
for a, b in zip(A, B):
if a > b:
surplus_scores.append(a - b)... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
surplus_scores = []
sum_lack_score = 0
ans = 0
for a, b in zip(A, B):
if a > b:
surplus_scores.append(a - ... | p03151 |
import sys
read = sys.stdin.readline
N = int(read())
A = list(map(int, read().split()))
B = list(map(int, read().split()))
d = [i - j for i, j in zip(A, B)]
d.sort()
if d[0] >= 0:
print((0))
exit()
n = 0
below = 0
for i in d:
if i < 0:
below += i
n += 1
else:
... | import sys
read = sys.stdin.readline
N = int(read())
A = list(map(int, read().split()))
B = list(map(int, read().split()))
d = [i - j for i, j in zip(A, B)]
d.sort()
if d[0] >= 0:
print((0))
exit()
elif sum(d) < 0:
print((-1))
exit()
n = 0
below = 0
for i in d:
if i < 0:
... | p03151 |
def c_exam_and_wizard(N, A, B):
ans = 0
short_val = 0 # 合格に不足する準備度
can_give = []
for a, b in zip(A, B):
if a < b:
ans += 1
short_val += b - a
elif a > b:
can_give.append(a - b)
if short_val == 0:
return 0
can_give.sort()
... | def c_exam_and_wizard(N, A, B):
ans = 0
sum_of_shortage_for_passing_mark = 0
campensation_for_shortage = []
for a, b in zip(A, B):
if a < b:
ans += 1
sum_of_shortage_for_passing_mark += b - a
elif a > b:
campensation_for_shortage.append(a - b)... | p03151 |
def c_exam_and_wizard(N, A, B):
ans = 0
sum_of_shortage_for_passing_mark = 0
campensation_for_shortage = []
for a, b in zip(A, B):
if a < b:
ans += 1
sum_of_shortage_for_passing_mark += b - a
elif a > b:
campensation_for_shortage.append(a - b)... | def c_exam_and_wizard(N, A, B):
ans = 0
sum_of_shortage_for_passing_mark = 0
campensation_for_shortage = []
for a, b in zip(A, B):
if a < b:
ans += 1
sum_of_shortage_for_passing_mark += b - a
elif a > b:
campensation_for_shortage.append(a - b)... | p03151 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
cnt = 0
lack = 0
for i in range(n):
if a[i] < b[i]:
cnt += 1
lack += b[i] - a[i]
elif a[i] > b[i]:
c.append(a[i] - b[i])
c = sorted(c)[::-1]
asum = sum(a)
bsum = sum(b)... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
cnt = 0
lack = 0
for i in range(n):
diff = a[i] - b[i]
if diff < 0:
cnt += 1
lack -= diff
elif diff > 0:
c.append(diff)
c = sorted(c)[::-1]
if sum(a) < sum(b):
... | p03151 |
n = int(eval(input()))
a = list(map(int,input().split()))
flag = 1
count = 0
while flag:
flag = 0
for i in range(n-1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
count += 1
flag = 1
print(count) | n = int(eval(input()))
s = list(map(int,input().split()))
count = 0
def merge(a, left, mid, right):
global count
l = a[left:mid] + [float("inf")]
r = a[mid:right] + [float("inf")]
i = j = 0
for k in range(left, right):
if l[i] <= r[j]:
a[k] = l[i]
i += 1
... | p02274 |
sentinel = 1000000001
def merge(A, left, mid, right):
"""Merge the two sorted partial sequences A[left:mid] and A[mid:right].
To count the number of inversions,
make a global declaration for the variable cnt.
"""
L = A[left:mid]
n1 = len(L)
L.append(sentinel)
R = A[mid:right... | sentinel = 1000000001
def merge(A, left, mid, right):
"""Merge the two sorted partial sequences A[left:mid] and A[mid:right].
To count the number of inversions,
make a global declaration for the variable cnt.
"""
L = A[left:mid]
n1 = len(L)
L.append(sentinel)
R = A[mid:right... | p02274 |
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(len(A) - 1):
for j in range(i + 1, len(A)):
if A[i] > A[j]: cnt += 1
print(cnt) | SENTINEL = 1000000001
def merge(A, l, m, r):
L = A[l:m] + [SENTINEL]
R = A[m:r] + [SENTINEL]
i = 0
j = 0
cnt = 0
for k in range(l, r):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
cnt += len(L) - 1 - i
return cnt
def merge_sort(A, l... | p02274 |
def g(A,l,m,r):
global c
L,R=A[l:m]+[1e9],A[m:r]+[1e9]
i=j=0
for k in range(l,r):
if L[i]<R[j]:A[k]=L[i];i+=1
else:A[k]=R[j];j+=1;c+=m-l-i
return c
def s(A,l,r):
if l+1<r:
m=(l+r)//2
return s(A,l,m)+s(A,m,r)+g(A,l,m,r)
else:return 0
c=0
n=int(eval(input()))
A=list(map(int,input().split()))... | def g(A,l,m,r):
global c
L,R=A[l:m]+[1e9],A[m:r]+[1e9]
i=j=0
for k in range(l,r):
if L[i]<R[j]:A[k]=L[i];i+=1;c+=j
else:A[k]=R[j];j+=1
def s(A,l,r):
if l+1<r:m=(l+r)//2;s(A,l,m);s(A,m,r);g(A,l,m,r)
c=0
n=int(eval(input()))
A=list(map(int,input().split()))
s(A,0,n)
print(c)
| p02274 |
#coding:UTF-8
def NI(A):
cnt=0
for i in range(len(A)):
for j in reversed(list(range(i+1,len(A)))):
if A[j]<A[j-1]:
swap=A[j]
A[j]=A[j-1]
A[j-1]=swap
cnt+=1
print(cnt)
if __name__=="__main__":
n=int(eval... | #coding:UTF-8
def Marge(A,left,mid,right):
n1=mid-left
n2=right-mid
L=[]
R=[]
c=0
for i in range(n1):
L.append(A[left+i])
for i in range(n2):
R.append(A[mid+i])
L.append(100000000000000000)
R.append(100000000000000000)
i=j=0
for k in range(left,... | p02274 |
n = int(eval(input()))
lis = list(map(int,input().split()))
def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2
# ここで分割を行う
left = arr[:mid]
right = arr[mid:]
# 再帰的に分割を行う
left = merge_sort(left)
right = merge_sort(right)
# returnが返ってきたら、結合を行... | #教室内の位置は右*中央
#問題は「Recursion / Divide and Conquer - The Number of Inversions」(http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_5_D&lang=jp)
#とりあえず入力部
n = int(eval(input()))
lis = list(map(int,input().split()))
#方針ですが、N=200000というところから、O(N)もしくはO(NlogN)であるという推測が立ちます。
#転倒数はバブルソートの時の入れ替えの回数というヒントが示されて... | p02274 |
def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
#print A[:mid]
#print A[mid:]
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
... | def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
lpos = 0
rpos = 0
rcount = 0
... | p02274 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.