input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# tenka1-2018-beginnerC - Align
from collections import deque
def main():
N, *A = list(map(int, open(0).read().split()))
A.sort()
if N & 1:
low, high, mid = A[: N // 2], A[N // 2 + 1 :], A[N // 2]
x = (sum(high) - sum(low)) * 2 - mid + low[-1]
y = (sum(high) - sum(low)) *... | # tenka1-2018-beginnerC - Align
def main():
N, *A = list(map(int, open(0).read().split()))
A.sort()
if N & 1:
low, high, mid = A[: N // 2], A[N // 2 + 1 :], A[N // 2]
x = (sum(high) - sum(low)) * 2 - mid + low[-1]
y = (sum(high) - sum(low)) * 2 + mid - high[0]
ans = m... | p03229 |
n = int(eval(input()))
A = [0 for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for k in range(i):
if a <= A[k]:
# print(A[k + 1: i + 1], A[k:i])
A[k + 1: i + 1] = A[k: i]
A[k] = a
break
else:
A[i] = a
# print(A)
#... | n = int(eval(input()))
A = []
for i in range(n):
A.append(int(eval(input())))
A.sort()
# print(A)
ans = 0
end = [A[0], A[-1]]
ans += abs(A[-1] - A[0])
A = A[1:-1]
s = 0
L = -1
for _ in range(n - 2):
# print(ans, A, end)
sl = [A[s], A[L]]
# print(sl)
tmp_l = []
tmp_l.append... | p03229 |
import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
if N == 2:
print((abs(A[0] - A[1])))
return
A.sort()
q = collections.deque(A)
ans = 0
... | import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N % 2 == 0:
ans = sum(A[N // 2:]) * 2 - A[N // 2] - sum(A[:N // 2]) * 2 + A[N // 2 - 1]
else... | p03229 |
n = int(eval(input()))
a = []
b = []
c = 0
for i in range(n):
ak = int(eval(input()))
a.append(ak)
a.sort()
for i in range(n-1):
bk = a[i+1] - a[i]
b.append(bk)
if len(b) % 2 == 1:
for i in range(len(b) // 2):
c += sum(b[i:len(b)-i])*2
c += b[len(b)//2]
else:
for i in range(len(b) // 2):
c ... | n = int(eval(input()))
a = []
b = []
d = []
c = 0
for i in range(n):
ak = int(eval(input()))
a.append(ak)
a.sort()
for i in range((len(a)-1)//2):
d.append(a[-i-1]-a[i])
for i in range(n-1):
bk = a[i+1] - a[i]
b.append(bk)
e = len(b)
c = sum(d) * 2
if e % 2 == 1:
c += b[e//2]
else:
c -= min(b[... | p03229 |
n = int(eval(input()))
a = sorted([int(eval(input())) for i in range(n)])
if n % 2 == 0:
small = a[:(n//2)]
big = a[(n//2):]
ans = sum(big) * 2 - sum(small) * 2 - big[0] + small[-1]
print(ans)
else:
small = a[:(n//2)]
big = a[(n//2):]
ans = sum(big) * 2 - sum(small) * 2 - big... | n = int(eval(input()))
a = sorted([int(eval(input())) for i in range(n)])
l = n//2
if n % 2 == 0:
small = a[:l]
big = a[l:]
ans = sum(big) * 2 - sum(small) * 2 - big[0] + small[-1]
print(ans)
else:
small = a[:l]
big = a[l+1:]
ans = sum(big) * 2 - sum(small) * 2 - min(a[l] - s... | p03229 |
def main():
N, *A = list(map(int, open(0).read().split()))
A.sort()
if N % 2:
array1 = [-2] * (N // 2) + [1] * 2 + [2] * (N // 2 - 1)
array2 = [-2] * (N // 2 - 1) + [-1] * 2 + [2] * (N // 2)
ret1 = 0
ret2 = 0
for i in range(N):
ret1 += A[i]*array1[i]
ret2 += A[i]*a... | def main():
N, *A = list(map(int, open(0).read().split()))
A.sort()
if N % 2:
array1 = [-2] * (N // 2) + [1] * 2 + [2] * (N // 2 - 1)
array2 = [-2] * (N // 2 - 1) + [-1] * 2 + [2] * (N // 2)
ret1 = 0
ret2 = 0
for i, j, k in zip(A, array1, array2):
ret1 += i * j
ret2... | p03229 |
from collections import *
a = sorted(int(eval(input())) for _ in range(int(eval(input()))))
q = deque(a)
rq = deque([q.popleft()])
while q:
rq.appendleft(q.pop())
if q:
rq.append(q.pop())
if q:
rq.appendleft(q.popleft())
if q:
rq.append(q.popleft())
r1 = sum(abs(i-j... | n = int(eval(input()))
a = sorted(int(eval(input())) for _ in range(n))
if n == 2:
print((abs(a[0] - a[1])))
elif n%2 == 1:
r1 = a[n//2] + a[n//2+1] + sum(a[n//2+2:])*2 - sum(a[:n//2])*2
r2 = sum(a[n//2+1:])*2 - sum(a[:n//2-1])*2 - a[n//2-1] - a[n//2]
print((max(r1, r2)))
else:
r1 = sum(a[n... | p03229 |
from collections import deque
N = int(eval(input()))
H = []
Q = deque()
for i in range(N):
A = int(eval(input()))
H.append(A)
H.sort()
#H = deque(H)
if N%2 == 0:
groupA = H[:N//2]
groupB = H[N//2:]
ans = 2*sum(groupB)-2*sum(groupA)-groupB[0]+groupA[-1]
else:
groupA1 = H[:N//2]
groupB1 = H... | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A.sort()
if N%2 == 0:
S = A[:N//2]
L = A[N//2:]
ans = 2*sum(L)-L[0]-2*sum(S)+S[-1]
else:
S1 = A[:N//2]
L1 = A[N//2:]
S2 = A[:N//2+1]
L2 = A[N//2+1:]
ans1 = 2*sum(L1)-L1[0]-L1[1]-2*sum(S1)
ans2 = 2*sum(L2)-2*sum(S2)+S2[-1]... | p03229 |
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A_ = sorted(A)
A_r = list(reversed(A_))
l = []
for i, (x, y) in enumerate(zip(A_[:N//2], A_r[:N//2])):
if i % 2 == 0:
l.append(x)
l.insert(0, y)
else:
l.append(y)
l.insert(0, x)
if N % 2 != 0:
... | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A_ = sorted(A)
A_r = list(reversed(A_))
n = (A_[0], A_r[0])
sum = abs(n[0] - n[1])
for i, (x, y) in enumerate(zip(A_[1:N//2], A_r[1:N//2])):
sum += abs(n[0] - y) + abs(n[1] - x)
n = (x, y)
if N%2 != 0:
m = A_[N//2]
sum +=... | p03229 |
def main():
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A.sort()
from collections import deque
def make1():
d = deque(A)
ret = deque([d.popleft()])
for i in range((N-1)//2):
if i & 1:
j = d.popleft()
... | def main():
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A.sort()
le, ri = A[-1], A[-1]
# print(le, ri)
from collections import deque
A = deque(A[:N-1])
ans = 0
for i in range(N-1):
cur = [abs(A[0] - le), abs(A[-1] - ri),
abs(A[-... | p03229 |
import itertools
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
p = list(itertools.permutations(a))
vs = []
rv = 0
for i in range(len(p)):
s = 0
for ii in range(len(p[i])):
if (ii>0):
s += abs(p[i][ii]-p[i][ii-1])
if s > rv:
... | import itertools
def getNext(tv, ta):
maxv = abs(max(ta)-tv)
minv = abs(tv-min(ta))
if (maxv > minv):
return max(ta)
else:
return min(ta)
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
vs = []
for i in range(len(a)):
s = 0
... | p03229 |
import collections
N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
A.sort()
s = collections.deque([A[0]])
i = 1
j = N-1
while i <= j:
xl = max(abs(s[0]-A[j]), abs(s[-1]-A[j]))
xs = max(abs(s[0]-A[i]), abs(s[-1]-A[i]))
if xl > xs:
x = A[j]
j -... | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
n = ini()
a = ... | p03229 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N % 2 == 0:
ans = 0
for i in range(N // 2):
ans -= 2 * A[i]
for i in range(N // 2, N):
ans += 2 * A[i]
ans += A[N // 2 - 1]
ans -= A[N // 2]
print(ans)
else:
ans1 = 0
for i in ra... | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N % 2 == 0:
ans = A[N // 2] - A[N // 2 - 1]
... | p03229 |
n=int(eval(input()))
a=[]
for i in range(n):
b=int(eval(input()))
a.append(b)
a.sort()
ans=["" for i in range(n)]
ans[n//2]=a[-1]
a.remove(a[-1])
l=(n//2)-1
r=(n//2)+1
num=0
for i in range(n-1):
if i%4==0:
ans[l]=a[0]
a.remove(a[0])
num+=abs(ans[l+1]-ans... | n=int(eval(input()))
l=[]
for i in range(n):
l.append(int(eval(input())))
l.sort()
if n%2==0:
ln=l[:n//2]
lx=l[n//2:]
print((2*(sum(lx)-sum(ln))-lx[0]+ln[-1]))
else:
ln=l[:n//2]
lm=l[n//2]
lx=l[n//2+1:]
p=sum(lx)
q=sum(ln)
print((max(2*(p-q)+ln[-1]-lm,2*(p-q)-lx[0]... | p03229 |
from collections import*
n,*a=list(map(int,open(0).read().split()))
a.sort()
d=len(a)//2
flag=0
if len(a)%2==1:
b=a[:d+1]
c=a[d+1:]
flag=1
else:
b=a[:d]
c=a[d:]
l=[]
for i in range(d):
l.append(c[i])
l.append(b[i])
if flag:
if abs(l[-1]-b[-1])>abs(l[0]-b[-1]):
l... | n,*a=list(map(int,open(0).read().split()))
a.sort()
d=len(a)//2
flag=0
if len(a)%2==1:
b=a[:d+1]
c=a[d+1:]
flag=1
else:
b=a[:d]
c=a[d:]
l=[]
for i in range(d):
l.append(c[i])
l.append(b[i])
if flag:
if abs(l[-1]-b[-1])>abs(l[0]-b[-1]):
l.append(b[-1])
else:
... | p03229 |
# https://atcoder.jp/contests/tenka1-2018-beginner/submissions/6799465
def tenka18beg_c():
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N % 2 == 0:
lower = A[:N//2]
upper = A[N//2:]
ans = (2 * sum(upper) - upper[0]) - (2 * sum(lower) - l... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def tenka18beg_c():
# https://atcoder.jp/contests/tenka1-2018-beginner/submissions/6799465
inp = list(map(int, read().split()))
N = inp[0]
A = inp[1:]
A.sort()
if N %... | p03229 |
from sys import stdin
from collections import deque
N = int(stdin.readline())
A = sorted([int(stdin.readline()) for i in range(N)])
ans1 = deque([A[N-1]])
ans2 = deque([A[0]])
f = 0
f2 = 1
b = N - 2
b2 = N - 1
s = True
while f <= b:
if s:
ans1.append(A[f])
f += 1
if f <= b... | from sys import stdin
N = int(stdin.readline())
A = sorted([int(stdin.readline()) for i in range(N)])
a = [0] * N
b = [0] * N
j = 1
for i in range(N-1):
a[i] += -j
a[i+1] += j
b[i] += j
b[i+1] += -j
j = -j
a.sort()
b.sort()
s1 = s2 = 0
for i in range(N):
s1 += a[i] * A[i]
... | p03229 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A = sorted(A)
res = 0
A2 = []
for i in range(len(A)):
if len(A) == 1:
if abs(A[0] - A2[0]) < abs(A[0] - A2[-1]):
A2.append(A[0])
else:
A2.insert(0,A[0])
break
if i % 2 == 0:
... | N = int(eval(input()))
A_in = [int(eval(input())) for _ in range(N)]
A = sorted(A_in)
res1 = 0
A2 = []
for i in range(len(A)):
if len(A) == 1:
if abs(A[0] - A2[0]) < abs(A[0] - A2[-1]):
A2.append(A[0])
else:
A2.insert(0,A[0])
break
if i % 2 == 0:
... | p03229 |
N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
A.sort()
if N % 2 == 1:
w = -2*sum(A[:N//2]) +A[N//2] +A[N//2 + 1] + 2*sum(A[N//2 + 2:])
m = -2*sum(A[:N//2-1]) - A[N//2 - 1] - A[N//2] + 2*sum(A[N//2+1:])
print((max(w, m)))
else:
print((-2*sum(A[:N//2-1]) -... | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N % 2 == 0:
print((-2*sum(A[:N//2-1]) - A[N//2-1] + A[N//2] + 2*sum(A[N//2+1:])))
else:
print((-2*sum(A[:N//2-1])
+ max(-2*A[N//2-1] + A[N//2] + A[N//2+1], - A[N//2-1] - A[N//2] + 2*A[N//2+1])
+ 2*sum(A[N... | p03229 |
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(int(eval(input())) for _ in range(n)))
A = deque(A)
B = deque([])
for i in range(n):
if i == 0:
... | import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(int(eval(input())) for _ in range(n)))
B = deque([])
for i in range(n // 2):
if i % 2 == 0:
B.appendle... | p03229 |
from collections import deque
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.sort()
a = deque(a)
b = deque([a.pop()])
ans = 0
for _ in range(n - 1):
x = max(
abs(a[0] - b[0]),
abs(a[0] - b[-1]),
abs(a[-1] - b[0]),
abs(a[-1] - b[-1]),
)
... | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
cand1 = [0] * n
cand2 = [0] * n
for i in range(n - 1):
if i % 2 == 0:
cand1[i] -= 1
cand1[i + 1] += 1
cand2[i] += 1
cand2[i + 1] -= 1
else:
cand1[i] += 1
cand1[i + 1] -= 1
can... | p03229 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
_a = a[:]
_a.sort()
__a = a[:]
__a.sort(reverse=True)
i = 0
cand_1 = [_a.pop(-1)]
cand_2 = [__a.pop(-1)]
while len(_a) > 0:
if i % 4 < 2:
_b = _a.pop(0)
__b = __a.pop(0)
else:
_b = _a.pop(-1)
__b =... | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.sort(reverse=True)
if n % 2 == 0:
res = 0
for i in range(n // 2 - 1):
res += a[i] * 2
res += a[n // 2 - 1]
res -= a[n // 2]
for i in range(n // 2 + 1, n):
res -= a[i] * 2
print(res)
else:
res1 ... | p03229 |
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a = sorted(a)
l = len(a)
if n % 2 == 0:
# 谷max, 山, 谷, ..., 山, 谷, 山min
tani = sorted(a[:l // 2], reverse=True)
yama = a[l // 2 + 1:] + [a[l // 2]]
ans = 0
for i in range(l //2):
ans += yama[i] - tani[i]
for ... | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a = sorted(a)
la = len(a)
if n % 2 == 0:
p = la // 2
ans = (sum(a[p:]) - sum(a[:p])) * 2 + a[p - 1] - a[p]
else:
p = la // 2
ans = (sum(a[p:]) - sum(a[:p])) * 2 - a[p] - a[p + 1]
p = la // 2 + 1
t = (sum(a[p:]) - su... | p03229 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p03229 |
# -*- coding: utf-8 -*-
import copy
from collections import deque
N = int(eval(input()))
aN = [int(eval(input())) for i in range(N)]
aN_sorted = sorted(aN)
aN_sorted = deque(aN_sorted)
aN2 = [0] * N
for i in range(N):
if i % 2 == 0:
aN2[i] = aN_sorted.popleft()
else:
aN2[i] = a... | # -*- coding: utf-8 -*-
# 終了後、重複処理を整理した版
from collections import deque
N = int(eval(input()))
aN = [int(eval(input())) for i in range(N)]
# 受け取ったリストを前後から交互に並べていく
def changeList(_list):
_list = deque(_list)
res = [0] * N
for i in range(N):
if i % 2 == 0:
res[i] = _list.... | p03229 |
import itertools
n=int(eval(input()))
x=[int(eval(input())) for i in range(n)]
listX = list(itertools.permutations(x, n))
listY = []
for j in range(len(listX)):
y = 0
for i in range(n-1):
y = y + abs(listX[j][i]-listX[j][i+1])
listY.append(y)
print((max(listY)))
| n = int(eval(input()))
listx = [int(eval(input())) for i in range(n)]
listx.sort()
listy=[]
x=listx.pop(0)
listy.append(x)
x=listx.pop(-1)
listy.append(x)
listy.sort()
while len(listx)>=1:
abs1=abs(listx[0]-listy[-1])
abs2=abs(listx[-1]-listy[0])
if abs1 < abs2:
x=listx.pop(-1)
... | p03229 |
from collections import deque
N = int(eval(input()))
A = deque(sorted([int(eval(input())) for _ in range(N)]))
B = deque([])
B.append(A.popleft())
cnt = 0
while A:
a0 = A[0]
a1 = A[-1]
b0 = B[0]
b1 = B[-1]
c00 = abs(a0-b0)
c01 = abs(a0-b1)
c10 = abs(a1-b0)
c11 = abs(a1-b1)
... | N = int(eval(input()))
A = sorted([int(eval(input())) for _ in range(N)])
if N%2==0:
B = A[:N//2]
C = A[N//2:]
C = C[::-1]
D1 = []
D2 = []
for i in range(N//2-1):
D1.append(B[i])
D1.append(C[i])
D2.append(C[i])
D2.append(B[i])
D1.append(B[-1])
... | p03229 |
h = []
N = int(eval(input()))
for i in range(N):
v = int(eval(input()))
h.append(v)
h.sort()
hh = h.copy()
ans = 0
t = h.pop(-1)
t1 = t
pm = 0
while 1:
t2 = h.pop(pm)
ans += abs(t - t2)
if len(h) == 0:
break
t = t2
t3 = h.pop(pm)
ans += abs(t1 - t3)
i... |
import sys
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
# def main():
# N = int(input())
# for i in range(N):
# v = int(input())
# h.append(v)
def main():
N, *h = list(map(int, read().split()))
h.sort()
hh = h.c... | p03229 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from collections import deque
from math import ceil
n = int(readline())
a = sorted([int(readline()) for i in range(n)])
c = deque(a[:ceil(n / 2)])
d = deque(a[... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, *a = list(map(int, read().split()))
a.sort()
a1 = 2 * (sum(a[(n + 1) // 2:]) - sum(a[:(n + 1) // 2]))
a2 = 2 * (sum(a[n // 2:]) - sum(a[:n // 2]))
if n % 2 == ... | p03229 |
from collections import deque
def main():
N = int(eval(input()))
A = deque(sorted((int(eval(input())) for i in range(N))))
dq = deque()
dq.append(A.popleft())
for _ in range(N-1):
a_first = A[0]
a_last = A[-1]
dq_first = dq[0]
dq_last = dq[-1]
f... | from collections import deque
def main():
N = int(eval(input()))
A = deque(sorted((int(eval(input())) for i in range(N))))
dq = deque()
dq.append(A.popleft())
ans = 0
for _ in range(N-1):
a_first = A[0]
a_last = A[-1]
dq_first = dq[0]
dq_last = dq[-1]... | p03229 |
# encoding: utf-8
import math
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A_up = sorted(A)
A_down = list(A_up[::-1])
rslt = []
idx_up = 0
idx_down = 0
for i in range(N):
if i % 4 == 0:
rslt = [A_up[idx_up]] + rslt
idx_up += 1
elif i % 4 == 1:
rsl... | # encoding: utf-8
import math, sys
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
A_up = sorted(A)
A_down = list(A_up[::-1])
# magic-hand-like order
# 1 2 3
# |X X 4 <- this node is taken last
# 7 6 5
ans = 0
for i in range(N // 2):
if i == 0:
ans += (A_down[0] - A_u... | p03229 |
import sys
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | import sys
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | p03229 |
def solve(pos):
start = pos
ans = 0
a = 0
b = N - 1
for i in range(N-1):
if a==start:
a += 1
elif b==start:
b -= 1
if abs(A[a]-A[pos])>=abs(A[b]-A[pos]):
ans += abs(A[a]-A[pos])
pos = a
a += 1
e... | N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
A.sort()
PLUS = A[int((N+1)//2):]
MINUS = A[:int((N+1)//2)]
#print(PLUS, MINUS)
ans = sum(PLUS)*2 - sum(MINUS)*2
if N%2==0:
ans += MINUS[-1] - PLUS[0]
else:
ans += sum(MINUS[-2:])
PLUS = A[int(N//2):]
MINUS = A[:... | p03229 |
N=int(eval(input()))
A=[]
for i in range(N):A.append(int(eval(input())))
A=sorted(A)
B=[0]*N
if N%2==0:
for i in range(N):
if i==N//2-1:
B[0]=A[i]
elif i<N//2-1:
B[i*2+2]=A[i]
else:
B[-(i-N//2)*2-1]=A[i]
else:
for i in range(N):
... | N=int(eval(input()))
A=sorted(int(eval(input()))for _ in [0]*N)
n=N//2
print((A[n]+2*sum(A[n+1:])-2*sum(A[:n-1])-A[n-1]if N%2==0 else max(A[n]+A[n+1]+2*sum(A[n+2:])-2*sum(A[:n]),2*sum(A[n+1:])-2*sum(A[:n-1])-A[n-1]-A[n]))) | p03229 |
from collections import deque
n = int(eval(input()))
A = sorted(int(eval(input()))for _ in range(n))
L = 1
R = n-1
B = deque([A[0]])
prev_L = A[0]
prev_R = A[0]
while L <= R:
x, y = A[L], A[R]
if abs(min(prev_L, prev_R)-y) < abs(max(prev_L, prev_R)-x):
if prev_L < prev_R:
B.appen... | n = int(eval(input()))
A = sorted(int(eval(input()))for _ in range(n))
if n % 2 == 0:
low = A[:n//2]
high = A[n//2:]
ans = abs(2*sum(high)-high[0]-(2*sum(low)-low[-1]))
else:
low = A[:n//2]
high = A[n//2+1:]
mid = A[n//2]
ans = abs(2*sum(high)-high[0]-(2*sum(low)-low[-1]))
a... | p03229 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A = sorted(A)
ans1 = 0
l = 0
r = N-1
for i in range(N-2):
if i%2 == 0:
ans1 += 2 * A[r]
r -= 1
else:
ans1 += -2 * A[l]
l += 1
if N%2 == 0:
ans1 -= min(A[l], A[r])
ans1 += max(A[l], A[r])
e... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
A.sort()
B = [A[i // 2] if i & 1 == 0 else A[-1 - i // 2] for i in range(N)]
C = [A[i // 2] if i & 1 == 1 else A[-1 - i // 2] for i in range(N)]
print((max(f(B), f(C))))
def f(L):
res = 0
for i in range(len(L)... | p03229 |
def calc_score(li):
prev = li[0]
ret = 0
for el in li:
ret += abs(el - prev)
prev = el
return ret
N, *A = list(map(int, open(0).read().split()))
A = sorted(A)
if N % 2:
ans = 0
li = [0] * N
li[0] = A[N // 2]
for i in range(N // 2):
li[i * 2 + 1] ... | N, *A = list(map(int, open(0).read().split()))
M = N // 2
A.sort()
ans = 0
if N % 2:
for i in range(1, M):
ans += A[i + M + 1] - A[i - 1]
ans += A[i + M + 1] - A[i]
ans += A[M + 1] - A[0]
ans = max(A[M + 1] - A[M] + ans, ans + A[M] - A[M - 1])
else:
ans += A[M] - A[0]
for... | p03229 |
from itertools import permutations
n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
def f(x):
cnt = 0
for i in range(len(x) - 1):
cnt += abs(x[i] - x[i + 1])
return cnt
ans = []
for B in permutations(A):
ans.append((f(B), B))
ans.sort(reverse=True)
print((ans[0][0]))... | def solve():
n = int(eval(input()))
a = sorted(int(eval(input())) for _ in range(n))
c0 = n // 2 - 1
c1 = n // 2
c2 = n // 2 + 1
ans = 0
if n & 1:
for i in range(c0):
ans -= a[i] * 2
for i in range(c2 + 1, n):
ans += a[i] * 2
ans +=... | p03229 |
def solve():
n = int(eval(input()))
a = sorted(int(eval(input())) for _ in range(n))
c0 = n // 2 - 1
c1 = n // 2
c2 = n // 2 + 1
ans = 0
if n & 1:
for i in range(c0):
ans -= a[i] * 2
for i in range(c2 + 1, n):
ans += a[i] * 2
ans +=... | import sys
readline = sys.stdin.readline
def solve():
n = int(eval(input()))
a = sorted(int(readline()) for _ in range(n))
c0 = n // 2 - 1
c1 = n // 2
c2 = n // 2 + 1
ans = 0
if n & 1:
ans = sum(a[c2 + 1:]) * 2 - sum(a[:c0]) * 2 - a[c0] + a[c2] + max(-a[c0] + a[c1], - a[c1]... | p03229 |
N=int(eval(input()))
A=[int(eval(input())) for i in range(N)]
A.sort()
ans=[A[0],A[-1]]
l=1
r=-2
n=[0]*4
ansn=abs(A[0]-A[-1])
for i in range(N-2):
n[0]=abs(A[l]-ans[0])
n[1]=abs(A[l]-ans[-1])
n[2]=abs(A[r]-ans[0])
n[3]=abs(A[r]-ans[-1])
if n[0]==max(n):
ansn+=n[0]
... | N=int(eval(input()))
A=[int(eval(input())) for i in range(N)]
A.sort()
ansl=A[0]
ansr=A[-1]
l=1
r=-2
n=[0]*4
ansn=abs(A[0]-A[-1])
for i in range(N-2):
n[0]=abs(A[l]-ansl)
n[1]=abs(A[l]-ansr)
n[2]=abs(A[r]-ansl)
n[3]=abs(A[r]-ansr)
if n[0]==max(n):
ansn+=n[0]
ans... | p03229 |
import collections
N=int(eval(input()))
A=[int(eval(input())) for i in range(N)]
A.sort()
ans=[A[0],A[-1]]
ans=collections.deque(ans)
l=1
r=-2
n=[0]*4
ansn=abs(A[0]-A[-1])
for i in range(N-2):
n[0]=abs(A[l]-ans[0])
n[1]=abs(A[l]-ans[-1])
n[2]=abs(A[r]-ans[0])
n[3]=abs(A[r]-ans[-1])... | N=int(eval(input()))
A=[int(eval(input())) for i in range(N)]
A.sort()
k1=[]
if N%2==1:
k1.extend([1,1])
k1.extend([-2]*(N//2))
k1.extend([2]*(N-N//2-2))
k1.sort()
sum1=0
sum2=0
for i in range(N):
sum1+=A[i]*k1[i]
sum2+=(-1)*A[i]*k1[-1-i]
print((max(sum1... | p03229 |
def c_align(N, A):
from collections import deque
if N == 2:
return abs(A[0] - A[1])
tmp = sorted(A)
seq = tmp[:]
old_check = seq.pop(-1 + N // 2) if N % 2 == 0 else seq.pop(N // 2)
current_check = -1
seq = deque(seq)
ans1 = 0
turn = 0
while seq:
curr... | def c_align(N, A):
A.sort()
seq = [0] * N
if N % 2 == 0:
for k in range(N - 2, -1, -2):
seq[k] = A.pop()
for k in range(N - 1, 0, -2):
seq[k] = A.pop()
ans = 0
for k in range(N - 1):
ans += abs(seq[k] - seq[k + 1])
else:
... | p03229 |
N=int(eval(input()))
num=[int(eval(input())) for i in range(N)]
num.sort()
jun=[]
sig=[i for i in range(1,N+1)]
if N%2!=0: #kisu
manaka=int(N/2)
if abs(num[manaka]-num[0])<abs(num[manaka]-num[N-1]):
jun.append(manaka)
for i in range(int((N-1)/2)):
jun.append(max(sig)-1)
sig.remove(max... | N=int(eval(input()))
num=[int(eval(input())) for i in range(N)]
num.sort()
if N%2!=0: #kisu
manaka=int(N/2)
sum_a=abs(num[manaka]-num[N-1])
sum_a+=abs(num[N-1]-num[0])
for i in range(int((N-1)/2)-1):
sum_a+=abs(num[N-2-i]-num[i])
sum_a+=abs(num[i+1]-num[N-2-i])
sum_b=abs(num[manaka]-num[... | p03229 |
def main():
M = 2**12
N = int(eval(input()))
V = []
W = []
for i in range(N):
v,w = list(map(int,input().split()))
V.append(v)
W.append(w)
dp = [[0]*(10**5+1) for _ in range(min(M,N+1))]
for n in range(1,min(M,N+1)):
for l in range(10**5+1):
... | def main():
M = 2**11
N = int(eval(input()))
V = []
W = []
for i in range(N):
v,w = list(map(int,input().split()))
V.append(v)
W.append(w)
dp = [[0]*(10**5+1) for _ in range(min(M,N+1))]
for n in range(1,min(M,N+1)):
for l in range(10**5+1):
... | p02648 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
VW = [[0,0]] + [list(map(int,input().split())) for i in range(N)]
Q = int(eval(input()))
vL = [list(map(int,input().split())) for i in range(Q)]
vs,Ls = list(zip(*vL))
appear = []
for v in vs:
v *= 2
while v:
v //= 2
ap... | import sys
lines = sys.stdin.readlines()
#N = int(input())
#VW = [[0,0]] + [list(map(int,input().split())) for i in range(N)]
#Q = int(input())
#vL = [list(map(int,input().split())) for i in range(Q)]
#vs,Ls = zip(*vL)
N = int(lines[0])
Q = int(lines[N+1])
vL = [list(map(int,s.split())) for s in lines[N+2:... | p02648 |
#!/usr/bin/env python3
def main():
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
V = []
W = []
maxL = 10**5
m = min(n, 1 << 10)
dp = [[0]*(maxL + 1)]
for i in range(n):
v, ... | #!/usr/bin/env python3
def main():
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
V = []
W = []
maxL = 10**5
m = min(n, 1 << 10)
dp = [[0]*(maxL + 1)]
for i in range(n):
v, ... | p02648 |
#!/usr/bin/env python3
def main():
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
V = []
W = []
maxL = 10**5
m = min(n, 1 << 10)
dp = [[0]*(maxL + 1)]
for i in range(n):
v, ... | #!/usr/bin/env python3
def main():
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
V = []
W = []
maxL = 10**5
m = min(n, 1 << 10)
dp = [[0]*(maxL + 1)]
for i in range(n):
v, ... | p02648 |
import copy
n = int(eval(input()))
size = 100001
vw = []
for i in range(n):
V, w = list(map(int, input().split()))
vw.append([V, w])
status = [False] * (n + 1)
status[0] = [-1] * size
status[0][0] = 0
q = int(eval(input()))
for i in range(q):
v, l = list(map(int, input().split()))
root = ... | import copy
n = int(eval(input()))
size = 100001
vw = []
for i in range(n):
V, w = list(map(int, input().split()))
vw.append([V, w])
status = [False] * (n + 1)
status[0] = {0:0}
q = int(eval(input()))
for i in range(q):
v, l = list(map(int, input().split()))
root = [v]
while root[-1] ... | p02648 |
import sys
n, *inp = list(map(int, sys.stdin.buffer.read().split()))
vvv = [0] + inp[0:n * 2:2]
www = [0] + inp[1:n * 2:2]
weight_limit = 10 ** 5
precalc_limit = min(1 << 11, n + 1)
precalc = [[0] * (weight_limit + 1)]
for u in range(1, precalc_limit):
v = vvv[u]
w = www[u]
dp = precalc[u >>... | import sys
def get_solve():
cache = [None] * precalc_limit
cache[0] = [0] * (weight_limit + 1)
_vvv = vvv
_www = www
_weight_limit = weight_limit
def _f(u):
""" u < precalc_limit """
if cache[u] is not None:
return cache[u]
dp = _f(u >> 1).cop... | p02648 |
import sys
readline = sys.stdin.readline
def mergeup(Av, Aw, vw):
v, w = vw
rv, rw = [], []
va = rv.append
wa = rw.append
N = len(Av)
idx = 0
jdx = 0
for _ in range(2*N):
if idx == N or Aw[idx] > Aw[jdx] + w:
if Aw[jdx] + w > limit:
br... | import sys
readline = sys.stdin.readline
def mergeup(Av, Aw, vw):
v, w = vw
rv, rw = [], []
N = len(Av)
idx = 0
jdx = 0
for _ in range(2*N):
if idx == N or Aw[idx] > Aw[jdx] + w:
if Aw[jdx] + w > limit:
break
rw.append(Aw[jdx]+w)
... | p02648 |
import sys
input=sys.stdin.buffer.readline
N=int(eval(input()))
vw=[(-1,-1)]
for i in range(N):
vw.append(tuple(map(int,input().split())))
dp=[[0 for i in range(100001)] for i in range(2**9)]
for i in range(vw[1][1],100001):
dp[1][i]=vw[1][0]
MAX=min(2**9,N+1)
for i in range(2,MAX):
v,w=vw[i]... | import sys,random,time,bisect
input=sys.stdin.buffer.readline
start=time.time()
N=int(eval(input()))
vw=[(-1,-1)]
for i in range(N):
vw.append(tuple(map(int,input().split())))
dp=[[] for i in range(2**9)]
def make_dp(v):
t=[[0,0] for i in range(15)]
V=v
id=0
while v>=1:
t[id... | p02648 |
import sys,random,time,bisect
input=sys.stdin.buffer.readline
start=time.time()
N=int(eval(input()))
vw=[(-1,-1)]
for i in range(N):
vw.append(tuple(map(int,input().split())))
dp=[[] for i in range(2**9)]
def make_dp(v):
t=[[0,0] for i in range(15)]
V=v
id=0
while v>=1:
t[id... | import sys,random,time,bisect
input=sys.stdin.buffer.readline
start=time.time()
N=int(eval(input()))
vw=[(-1,-1)]
for i in range(N):
vw.append(tuple(map(int,input().split())))
dp=[[] for i in range(2**9)]
def make_dp(v):
t=[[0,0] for i in range(15)]
V=v
id=0
while v>=1:
t[id... | p02648 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02648 |
def main():
import sys
input = sys.stdin.readline
n = int(eval(input()))
L_MAX = 10**5
D_TH = 10
V_MAX = (1 << D_TH) - 1
dp = [[0] * (L_MAX + 1)]
# items = []
items_v = []
items_w = []
for i in range(n):
val, w = list(map(int, input().split()))
... | def main():
import sys
input = sys.stdin.readline
n = int(eval(input()))
L_MAX = 10**5
D_TH = 10
V_MAX = (1 << D_TH) - 1
dp = [[0] * (L_MAX + 1)]
# items = []
items_v = []
items_w = []
for i in range(n):
val, w = list(map(int, input().split()))
... | p02648 |
import sys
sys.setrecursionlimit(10**9)
import sys
input = sys.stdin.readline
n=int(eval(input()))
vw=[list(map(int,input().split())) for _ in range(n)]
q=int(eval(input()))
vl=[list(map(int,input().split())) for _ in range(q)]
#import numpy as np
#dp=np.full((n+1,10**5+1),-1,int)
dp=[[-1]*(10**5+1) for _ i... | import sys
sys.setrecursionlimit(10**9)
import sys
input = sys.stdin.readline
n=int(eval(input()))
vw=[list(map(int,input().split())) for _ in range(n)]
q=int(eval(input()))
vl=[list(map(int,input().split())) for _ in range(q)]
from collections import defaultdict
dp=defaultdict(lambda:-1)
#dp=[[-1]*(10**5+1... | p02648 |
N=int(eval(input()))
V=[]
W=[]
S=10**5
D=[[0]*(S+1) for _ in range(N+1)] #D[x][k]:wまで,重さw以下
for i in range(N):
v,w=list(map(int,input().split()))
V.append(v)
W.append(w)
for x in range(1,N+1):
for w in range(S+1):
if w>=W[x-1]:
D[x][w]=max(D[x>>1][w],D[x>>1][w-W[x-1]]... | from math import ceil,log
N=int(eval(input()))
V=[]
W=[]
S=100
for i in range(N):
v,w=list(map(int,input().split()))
V.append(v)
W.append(w)
Q=int(eval(input()))
for _ in range(Q):
v,L=list(map(int,input().split()))
d=ceil(log(v+1,2))
D=[[0]*(L+1) for _ in range(d... | p02648 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [[0,0]]+[list(map(int,readline().split())) for _ in range(n)]
#print(vw)
A = 11
N = min(1<<A,n+1)
memo = [[0] for _ in range(N)]... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [[0,0]]+[list(map(int,readline().split())) for _ in range(n)]
def merge(av,aw,bv,bw):
la,lb = len(aw),len(bw)
rv = [0]*(l... | p02648 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [[0,0]]+[list(map(int,readline().split())) for _ in range(n)]
def merge(av,aw,bv,bw):
la,lb = len(aw),len(bw)
rv = [0]*(l... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [[0,0]]+[list(map(int,readline().split())) for _ in range(n)]
def merge(av,aw,bv,bw):
la,lb = len(aw),len(bw)
rv = [0]*(l... | p02648 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [[0,0]]+[list(map(int,readline().split())) for _ in range(n)]
def merge(av,aw,bv,bw):
la,lb = len(aw),len(bw)
rv = [0]*(l... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [[0,0]]+[list(map(int,readline().split())) for _ in range(n)]
def merge(av,aw,bv,bw):
la,lb = len(aw),len(bw)
rv = [0]*(l... | p02648 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [(0,0)]+[tuple(map(int,readline().split())) for _ in range(n)]
A = 10
N = min(1<<A,n+1)
memo = [None for _ in range(N)]
L = 10**... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [(0,0)]+[tuple(map(int,readline().split())) for _ in range(n)]
A = 10
N = min(1<<A,n+1)
memo = [None for _ in range(N)]
L = 10**... | p02648 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
#n,k,*a = map(int,read().split())
n, = list(map(int,readline().split()))
vw = [(0,0)]+[tuple(map(int,readline().split())) for _ in range(n)]
A = 10
N = min(1<<A,n+1)
memo = [None for _ in range(N)]
L = 10**... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int,readline().split()))
vw = [(0,0)]+[tuple(map(int,readline().split())) for _ in range(n)]
A = 10
N = min(1<<A,n+1)
memo = [None for _ in range(N)]
L = 10**5+1
memo[0] = [0]*L
for i in ra... | p02648 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int,readline().split()))
vw = [(0,0)]+[tuple(map(int,readline().split())) for _ in range(n)]
A = 10
N = min(1<<A,n+1)
memo = [None for _ in range(N)]
L = 10**5+1
memo[0] = [0]*L
for i in ra... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = map(int,readline().split())
vw = [(0,0)]+[tuple(map(int,readline().split())) for _ in range(n)]
A = 10
N = min(1<<A,n+1)
memo = [None for _ in range(N)]
L = 10**5+1
memo[0] = [0]*L
for i in range(1,... | p02648 |
import sys
from collections import deque
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10**6
def main():
N = int(eval(input()))
VW = [(inf, inf)] + [list(map(int, input().split())) for _ in range(N)]
Q = int(eval(input()))
query = tuple(tuple(map(int, input().split(... | import sys
import bisect
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
def merge(a, b):
res = []
i, j = 0, 0
while i < len(a) or j < len(b):
if j >= len(b) or (i < len(a) and a[i][0] < b[j][0]):
w, v = a[i]
i += 1
else:
w... | p02648 |
from collections import Counter
n=int(input())
l=[input() for i in range(n)]
c=Counter(l)
d=max(c.values())
max_list=[k for k,v in c.items() if v==d]
max_list.sort()
print(*max_list,sep="\n")
| from collections import Counter
a=open(0)
n=int(a.readline())
l=a.read().split()
c=Counter(l)
d=max(c.values())
max_list=[k for k,v in c.items() if v==d]
max_list.sort()
print(*max_list,sep="\n")
| p02773 |
N=int(input())
d={}
for i in range(N):
tmp = input()
if tmp in d:
d[tmp] += 1
else:
d[tmp] = 1
a = d.items()
b = d.values()
max_k_list = [kv[0] for kv in a if kv[1] == max(b)]
[print(i) for i in sorted(max_k_list)]
| N=int(input())
d={}
for i in range(N):
tmp = input()
if tmp in d:
d[tmp] += 1
else:
d[tmp] = 1
max_v=max(d.values())
ans=list(filter(lambda x: x[1] == max_v, d.items()))
[print(i[0]) for i in sorted(ans)]
| p02773 |
from collections import Counter
N, *S = open(0).read().split()
count = Counter(S)
ans_list = [i for i, j in list(count.items()) if j == max(count.values())]
ans_list.sort()
print(("\n".join(ans_list))) | from collections import Counter
N, *S = open(0).read().split()
count = Counter(S)
max_value = max(count.values())
ans_list = [i for i, j in list(count.items()) if j == max_value]
ans_list.sort()
print(("\n".join(ans_list))) | p02773 |
N=int(input())
S=[]
for _ in range(N):
S.append(input())
import collections
c=collections.Counter(S)
vl=list(c.values())
mv=max(vl)
ans=[]
cc=list(c.items())
cc.sort(key=lambda x:x[1], reverse=True)
for k, v in cc:
if v==mv:
ans.append(k)
else:
break
ans.sort()
[print(a) for a i... | N=int(input())
S=[]
for _ in range(N):
S.append(input())
import collections
c=collections.Counter(S)
vl=list(c.values())
# 最大要素数
mv=max(vl)
ans=[]
cc=list(c.items()) # 辞書を[key, value]のリストにする
cc.sort(key=lambda x:x[1], reverse=True) # valueで降順ソート
# 辞書リスト内のkey, valueを調べる
for k, v in cc:
if v==m... | p02773 |
from collections import Counter
N = int(input())
list = [input() for _ in range(0,N)]
counted = Counter(list)
res=[]
for letter,count in counted.most_common() :
if count < counted.most_common()[0][1]:
break
else:
res.append(letter)
[print(i) for i in sorted(res)]
| from collections import Counter
N = int(input())
list = [input() for _ in range(0,N)]
counted = Counter(list)
res_max= counted.most_common()[0][1]
ans = []
for k, v in counted.items():
if v == res_max:
ans.append(k)
ans.sort()
print(*ans, sep="\n")
| p02773 |
from collections import Counter
def main():
n = int(input())
s = [input() for _ in range(n)]
s_c = Counter(s)
# keys = [k for k, v in s_c.items() if v == max(s_c.values())]
# keys_s = sorted(keys)
keys =[k for k, v in s_c.items() if v == s_c.most_common()[0][1]]
keys_s = sorted(keys)... | from collections import Counter
def main():
n = int(input())
s = [input() for _ in range(n)]
s_c = Counter(s)
s_c_max = s_c.most_common()[0][1]
keys =[k for k, v in s_c.items() if v == s_c_max]
keys_s = sorted(keys)
print(*keys_s, sep='\n')
if __name__ == '__main__':
main()
| p02773 |
import sys
from collections import Counter
n, *s = sys.stdin.read().split()
def main():
cnt = sorted(Counter(s).items(), key=lambda x: -x[1])
m = cnt[0][1]
ans = [s for s, c in cnt if c == m]
print(*sorted(ans), sep='\n')
if __name__ == '__main__':
main()
| import sys
from collections import Counter
n, *s = sys.stdin.read().split()
def main():
c = Counter(s)
m = max(c.values())
ans = [s for s, v in c.items() if v == m]
print(*sorted(ans), sep='\n')
if __name__ == '__main__':
main()
| p02773 |
from collections import defaultdict
N = int(input())
s_counter = defaultdict(int)
for _ in range(N):
S = input()
s_counter[S] += 1
S_list = sorted(s_counter.items(), key=lambda x: x[1], reverse=True)
answer = []
for i in range(len(S_list)):
if S_list[0][1] != S_list[i][1]:
break
ans... | from collections import Counter
N = int(input())
counter = Counter([input() for _ in range(N)])
max_cnt = max(counter.values())
names = [name for name, cnt in counter.items() if cnt == max_cnt]
names.sort()
print(*names, sep='\n')
| p02773 |
import sys
from collections import Counter
input = sys.stdin.readline
n = int(input())
S = [input().rstrip() for _ in range(n)]
c = Counter(S).most_common()
words = []
max = c[0][1]
for i in range(len(c)):
if max == c[i][1]:
words.append(c[i][0])
words.sort()
print(*words, sep='\n')
| import sys
from collections import Counter
input = sys.stdin.readline
n = int(input())
S = [input().rstrip() for _ in range(n)]
c = Counter(S)
max = max(c.values())
words = [k for k, v in c.items() if max == v]
words.sort()
print(*words, sep='\n')
| p02773 |
import sys
input=sys.stdin.readline
n=int(eval(input()))
p=[]
for i in range(n):
s=input().rstrip()
p.append(s)
p.sort()
ans=0
cnt=1
for i in range(n-1):
if p[i]==p[i+1]:
cnt+=1
else:
ans=max(ans,cnt)
cnt=1
ans=max(ans,cnt)
q=[]
for i in range(n-ans+1):
if p[i]==p[i+ans-1]:
q.append(p[i... | table={}
import sys
input=sys.stdin.readline
n=int(eval(input()))
ss=[]
for i in range(n):
s=input().rstrip()
if s in table:
table[s]+=1
else:
table[s]=1
ss.append(s)
ans=[]
saidai=max(table.values())
for i in range(len(ss)):
if table[ss[i]]==saidai:
ans.append(ss[i])
ans.sort()
for x in a... | p02773 |
from collections import Counter
import sys
input = sys.stdin.readline
def solve():
N = int(eval(input()))
Sss = [input().rstrip() for _ in range(N)]
cnt = Counter(Sss)
#print('cnt:', cnt)
maxNum = max(cnt.values())
#print('maxNum:', maxNum)
anss = []
for key, value in ... | from collections import Counter
import sys
input = sys.stdin.readline
N = int(eval(input()))
Sss = [input().rstrip() for _ in range(N)]
cnt = Counter(Sss)
num = max(cnt.values())
anss = []
for key in sorted(cnt.keys()):
if cnt[key] == num:
anss.append(key)
print(('\n'.join(anss)))
| p02773 |
import collections
n = int(input())
dd = collections.defaultdict(int)
for _ in range(n):
dd[input()] += 1
ans = []
for key in dd.keys():
ans.append((dd[key], key))
ans.sort(reverse=True)
ans2 = [ans[0][1]]
for i in range(1, len(ans)):
if ans[i - 1][0] != ans[i][0]:
break
ans2.append... | import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s).most_common()
ans = []
for i in range(1, len(s) + 1):
ans.append(s[i - 1][0])
if i == len(s):
break
if s[i - 1][1] != s[i][1]:
break
ans.sort()
print(*ans, sep='\n')
| p02773 |
import sys
import collections
n = eval(input())
arr = [_.replace('\n', '') for _ in sys.stdin]
dic = collections.Counter(arr)
s = [k for k,v in list(dic.items()) if v == max(dic.values())]
for i in sorted(s):
print(i)
| import sys
import collections
n = eval(input())
arr = [_.replace('\n', '') for _ in sys.stdin]
dic = collections.Counter(arr)
cnt = list(dic.values()).count(max(dic.values()))
s = [k for k,v in dic.most_common(cnt)]
for i in sorted(s):
print(i) | p02773 |
import sys
import collections
input = lambda: sys.stdin.readline().rstrip()
def main():
n = int(input())
s = [input() for _ in range(n)]
cnt = collections.Counter(s)
values, counts = zip(*cnt.most_common())
d = sorted(values[:counts.count(counts[0])])
print(*d, sep='\n')
if __name_... | import sys
import collections
input = lambda: sys.stdin.readline().rstrip()
def main():
n = int(input())
s = [input() for _ in range(n)]
cnt = collections.Counter(s)
cnt_max = max(cnt.values())
d = [k for k, v in cnt.items() if v == cnt_max]
d = sorted(d)
print(*d, sep='\n')
i... | p02773 |
import collections
N = int(input())
S_list = []
for i in range(N):
s = input()
S_list.append(s)
c = collections.Counter(S_list)
c_max = c.most_common()
max_num = c.most_common()[0][1]
ans_list = []
ans_list.append(c.most_common()[0][0])
for i in range(1, len(c_max)):
if c.most_common()... | import collections
N = int(input())
S_list = []
for i in range(N):
s = input()
S_list.append(s)
c = collections.Counter(S_list)
c_max = c.most_common()
max_num = c.most_common()[0][1]
ans_list = []
ans_list.append(c.most_common()[0][0])
for i in range(1, len(c_max)):
if c_max[i][1] != ... | p02773 |
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
dic = Counter(S)
tmp = max(dic.values())
ans = [key for key, value in dic.items() if value == tmp]
# もうちょいかっこいい書き方があるはず。リストを1行1str出力 and 最後に改行しないように
for key in sorted(ans):
print(key, end="")
print("")
| from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
dic = Counter(S)
tmp = max(dic.values()) # ここ重要！
ans = [key for key, value in dic.items() if value == tmp]
# もうちょいかっこいい書き方があるはず。リストを1行1str出力 and 最後に改行しないように
"""
for key in sorted(ans):
print(key, end="")
print("")... | p02773 |
import collections
N = int(input())
data = [input() for i in range(N)]
dicdata = collections.Counter(data)
newdata = [k for k, v in dicdata.items() if v == max(dicdata.values())]
newdata.sort()
[print(i) for i in newdata]
| import collections
N = int(input())
data = [input() for i in range(N)]
dicdata = collections.Counter(data)
m = max(dicdata.values())
newdata = [k for k, v in dicdata.items() if v == m]
newdata.sort()
[print(i) for i in newdata]
| p02773 |
import sys
from collections import Counter
input = sys.stdin.readline
N = int(eval(input()))
l = []
for _ in range(N):
l.append(input().strip())
c = Counter(l)
for k, v in sorted(list(c.items()), key=lambda x: x[0]):
if v == max(c.values()):
print(k)
| import sys
from collections import Counter
input = sys.stdin.readline
N = int(eval(input()))
l = []
for _ in range(N):
l.append(input().strip())
c = Counter(l)
m = max(c.values())
c2 = [k for k, v in list(c.items()) if v == m]
for x in sorted(c2):
print(x)
| p02773 |
N=int(input())
S=list(input() for _ in range(N))
from collections import Counter
cnt=Counter(S)
max_cnt=cnt.most_common()[0][1]
ans=[]
for k, v in cnt.items():
if v!=max_cnt:
continue
ans.append(k)
print(*sorted(ans), sep="\n")
| N=int(input())
S=list(input() for _ in range(N))
from collections import Counter
cnt=Counter(S)
max_cnt=cnt.most_common()[0][1]
ans=[name for name, cnt in cnt.items() if cnt==max_cnt]
print(*sorted(ans), sep="\n")
| p02773 |
N,*S=open(0).read().split()
import collections
C=collections.Counter(S)
keys = [k for k, v in list(C.items()) if v == max(C.values())]
keys.sort()
for i in keys:
print(i) | N,*S=open(0).read().split()
import collections
C=collections.Counter(S)
M=max(C.values())
keys = [k for k, v in list(C.items()) if v == M]
keys.sort()
for i in keys:
print(i) | p02773 |
from operator import itemgetter
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
S = read().split()
dic = {}
for i in S:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
dic_sorted = sorte... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
S = read().split()
S = sorted(S)
ls = [[] for i in range(N + 1)]
max_num = 0
left = 0
right = 0
while right < N:
while right < N and S[left] == S[right]:
rig... | p02773 |
N = int(input())
dic, rst = {}, []
for i in range(N):
s = input()
if s in dic:
dic[s] += 1
else:
dic[s] = 1
rst = [ key for key, val in dic.items() if val == max(dic.values()) ]
[ print(i) for i in sorted(rst) ]
| N = int(input())
dic, rst = {}, []
for i in range(N):
s = input()
if s in dic:
dic[s] += 1
else:
dic[s] = 1
max_val = max(dic.values())
rst = [ key for key, val in dic.items() if val == max_val ]
[ print(i) for i in sorted(rst) ]
| p02773 |
N = int(input())
dic, rst = {}, []
for i in range(N):
s = input()
if s in dic:
dic[s] += 1
else:
dic[s] = 1
max_val = max(dic.values())
rst = [ key for key, val in dic.items() if val == max_val ]
[ print(i) for i in sorted(rst) ]
| N = int(input())
dic, rst = {}, []
for i in range(N):
s = input()
if not s in dic:
dic[s] = 1
else:
dic[s] += 1
max_val = max(dic.values())
rst = [ key for key, val in dic.items() if val == max_val ]
[ print(i) for i in sorted(rst) ]
| p02773 |
from sys import stdin
n = int(stdin.readline().rstrip())
s = []
d = [0] * 200000
max = 1
for i in range(n):
t = stdin.readline().rstrip()
d[i] = 1
for ss in s:
if t == ss:
d[i] = d[i] + 1
if max < d[i]:
max = d[i]
s.append(t)
result = ... | from sys import stdin
import math
n = int(stdin.readline().rstrip())
d = {}
max = 0
for i in range(n):
s = stdin.readline().rstrip()
if s in list(d.keys()):
d[s] += 1
else:
d[s] = 1
if max < d[s]:
max = d[s]
result = []
for key, value in list(d.items()):
... | p02773 |
n,*s=list(map(str,open(0).read().split()))
mydict={}
for i in set(s):
mydict[i]=1
for i in range(int(n)):
mydict[s[i]]+=1
"""
if s[i] in mydict:
mydict[s[i]]+=1
else:
mydict[s[i]]=1
"""
for i in sorted([kv[0] for kv in list(mydict.items()) if kv[1]==max(mydict.values(... | n,*s=list(map(str,open(0).read().split()))
mydict={}
for i in set(s):
mydict[i]=1
for i in s:
mydict[i]+=1
"""
if s[i] in mydict:
mydict[s[i]]+=1
else:
mydict[s[i]]=1
"""
v_max=max(mydict.values())
for i in sorted([kv[0] for kv in list(mydict.items()) if kv[1]==v_max... | p02773 |
import collections
n = int(input())
s=[input() for i in range(n)]
ans = list()
c = collections.Counter(s)
k = c.most_common()[0][1]
if n == 1:
print(s[0])
elif n >= 2 and len(c.keys()) == 1:
print(c.most_common()[0][0])
elif n >= 2 and len(c.keys()) == len(s):
ans = s
else:
for i in ran... | import collections
n = int(input())
s=[input() for i in range(n)]
ans = list()
c = collections.Counter(s)
m = max(c.values())
for k,v in c.items():
if v ==m:
ans.append(k)
ans.sort()
print(*ans,sep="\n")
| p02773 |
n = int(input())
for i in range(n):
if i == 0:
s = input()
S = {s: 1}
else:
s = input()
if s in S:
S[s] += 1
else:
S[s] = 1
max_k_list = [kv[0] for kv in S.items() if kv[1] == max(S.values())]
ans = sorted(max_k_list)
for a in ans:
... | n = int(input())
ans = []
for i in range(n):
if i == 0:
s = input()
S = {s: 1}
ans.append(s)
mx = 1
else:
s = input()
if s in S:
S[s] += 1
if S[s] > mx:
ans = [s]
mx = S[s]
elif S[s... | p02773 |
import sys
from collections import Counter
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
S = [sr() for _ in range(N)]
c = Counter(S)
l = c.most_common()
max = l[0][1]
answer = []
for k, v in l:
if v == max:
answer.append... | # coding: utf-8
import sys
from collections import Counter
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
S = [sr() for _ in range(N)]
counter = Counter(S)
mo = counter.most_common()
ma = mo[0][1]
answer = []
for k, v in mo:
if v... | p02773 |
from collections import Counter
N, *S = open(0).read().split()
C = Counter(S).most_common()
ma = C[0][1]
ans = sorted(k for k, v in C if v == ma)
for a in ans:
print(a) | from collections import Counter
N, *S = open(0).read().split()
C = Counter(S)
ma = max(C.values())
ans = sorted(k for k, v in list(C.items()) if v == ma)
for a in ans:
print(a) | p02773 |
#!/usr/bin/env python3
import sys
from collections import defaultdict
def solve(N: int, S: "List[str]"):
d = defaultdict(int)
for s in S:
d[s]+=1
return '\n'.join(sorted([kv[0] for kv in list(d.items()) if kv[1] == max(d.values())]))
# Generated by 1.1.6 https://github.com/kyuriden... | #!/usr/bin/env python3
import sys
from collections import defaultdict
def solve(N: int, S: "List[str]"):
d = defaultdict(int)
cnt_common = 0
commons = []
for s in S:
d[s] += 1
if cnt_common < d[s]:
cnt_common=d[s]
commons = [s]
elif cnt_com... | p02773 |
import collections
N = int(input())
S = [input() for _ in range(N)]
cnt = collections.Counter(S)
ans_list = []
for key, value in cnt.items():
if value == max(cnt.values()):
ans_list.append(key)
print(*sorted(ans_list), sep='\n')
| import collections
N = int(input())
S = [input() for _ in range(N)]
cnt = collections.Counter(S)
max_cnt = max(cnt.values())
ans_list = []
for key, value in cnt.items():
if value == max_cnt:
ans_list.append(key)
print(*sorted(ans_list), sep='\n')
| p02773 |
import collections
import sys
input = sys.stdin.readline
n = int(input())
s = []
for i in range(n):
s.append(input())
#print(s)
c = collections.Counter(s)
#print(c.most_common())
m = c.most_common()[0][1]
l = len(c.most_common())
ans = []
for i in range(l):
if c.most_common()[i][1] == m:
ans.appe... | import collections
import sys
input = sys.stdin.readline
n = int(input())
s = []
for i in range(n):
s.append(input())
#print(s)
c = collections.Counter(s)
#print(c.most_common())
x = c.most_common()
m = x[0][1]
l = len(x)
ans = []
for i in range(l):
if x[i][1] == m:
ans.append(x[i][0])
else:
... | p02773 |
from collections import Counter
import heapq
n = int(eval(input()))
ss = []
for _ in range(n):
ss.append(input().rstrip())
ctr = Counter(ss)
heap = [(-v, k) for k, v in list(ctr.items())]
heapq.heapify(heap)
maxv = heap[0][0]
while heap:
c = heapq.heappop(heap)
if c[0] != maxv:
break
... | from collections import Counter
n = int(eval(input()))
ss = []
for _ in range(n):
ss.append(input().rstrip())
ctr = Counter(ss)
a = sorted([(-v, k) for k, v in list(ctr.items())])
maxv = a[0][0]
for i in range(len(a)):
if a[i][0] != maxv:
break
print((a[i][1])) | p02773 |
from collections import Counter
n=int(input())
S=[input() for _ in range(n)]
cnt=Counter(S)
maxcnt=cnt.most_common()[0][1]
ans=[]
for i in range(len(cnt)):
if cnt.most_common()[i][1]==maxcnt:
ans.append(cnt.most_common()[i][0])
else:
break
ans.sort()
print(*ans,sep='\n')
| from collections import Counter
n=int(input())
S=[input() for _ in range(n)]
cnt=Counter(S)
cnt=cnt.most_common()
maxcnt=cnt[0][1]
ans=[]
for i in range(len(cnt)):
if cnt[i][1]==maxcnt:
ans.append(cnt[i][0])
else:
break
ans.sort()
print(*ans,sep='\n')
| p02773 |
N = int(eval(input()))
C = {}
for _ in range(N):
s = input().strip()
if s not in C:
C[s] = 0
C[s] += 1
C = sorted(list(C.items()),key=lambda x:x[0])
C = sorted(C,key=lambda x:x[1],reverse=True)
k = C[0][1]
for i in range(len(C)):
if C[i][1]==k:
print((C[i][0]))
else:brea... | N = int(eval(input()))
C = {}
for _ in range(N):
s = input().strip()
if s not in C:
C[s]=0
C[s] += 1
cmax = 0
for s in C:
cmax = max(cmax,C[s])
A = []
for s in C:
if C[s]==cmax:
A.append(s)
A = sorted(A)
for i in range(len(A)):
print((A[i])) | p02773 |
n = int(input())
a = {}
for i in range(n):
s = input()
a[s] = a.get(s,0) + 1
b = sorted([i for i in a.keys() if a[i]==max(a.values())])
[print(i) for i in b]
| n = int(input())
a = {}
for i in range(n):
s = input()
a[s] = a.get(s,0) + 1
max_a = max(a.values())
b = sorted([i for i in a.keys() if a[i]==max_a])
[print(i) for i in b]
| p02773 |
import collections
import itertools
n = int(input())
l = [input() for _ in [0] * n]
counter = collections.Counter(l)
a = counter.most_common()[0][-1]
b = itertools.takewhile(
lambda kv: kv[-1] == a, counter.most_common()
)
c = sorted(list(k for k, v in b))
print(*c,sep='\n')
| import collections
n = int(input())
l = [input() for _ in [0] * n]
counted = collections.Counter(l)
#print(counted)
# 最頻値を求める
m = max(counted.values())
#print(m)
# 頻出数の文字を集める
chars = [key for key, value in counted.items()
if value == m]
print(*sorted(chars),sep='\n')
| p02773 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.