input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# -*- coding: utf-8 -*-
import sys
from heapq import heapify, heappop
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 ra... | # -*- coding: utf-8 -*-
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(c)] for j in range(b)] for i in ... | p03148 |
from operator import itemgetter
N, K = list(map(int, input().split()))
TD = [list(map(int, input().split())) for _ in range(N)]
TD.sort(key=itemgetter(1), reverse=True)
selected = TD[:K]
dlc = sum(map(itemgetter(1), selected))
variety = set(map(itemgetter(0), selected))
used = set()
overlap = [] # ダブっているネ... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
TD = [lr() for _ in range(N)]
TD.sort(key=lambda x: x[1], reverse=True)
used = set()
overlap = []
for t, d in TD[:K]:
if t in used:
overlap.append(d)
else:
... | p03148 |
from heapq import heappush, heappop, heapreplace
INF = 10 ** 9 + 5
N, K, *TD = list(map(int, open(0).read().split()))
E = [[] for _ in range(N)]
for t, d in zip(*[iter(TD)] * 2):
E[t - 1].append(d)
for e in E:
if e:
e.sort(reverse=True)
else:
e.append(-INF)
E.sort(key=lamb... | from heapq import heappush, heapreplace
def main():
INF = 10 ** 9 + 5
N, K, *TD = list(map(int, open(0).read().split()))
E = [[] for _ in range(N)]
for t, d in zip(*[iter(TD)] * 2):
E[t - 1].append(d)
for e in E:
if e:
e.sort(reverse=True)
else:
... | p03148 |
from heapq import heappush, heappop, heapreplace
def main():
INF = 10 ** 9 + 7
N, K, *TD = list(map(int, open(0).read().split()))
E = [[] for _ in range(N)]
for t, d in zip(*[iter(TD)] * 2):
E[t - 1].append(d)
for e in E:
if e:
e.sort(reverse=True)
... | from heapq import heappush, heapreplace
def main():
INF = 10 ** 9 + 5
N, K, *TD = list(map(int, open(0).read().split()))
E = [[] for _ in range(N)]
for t, d in zip(*[iter(TD)] * 2):
E[t - 1].append(d)
for e in E:
if e:
e.sort(reverse=True)
else:
... | p03148 |
import heapq as hq
from collections import deque
from copy import deepcopy
N, K = list(map(int, input().split()))
Sushi = [None for _ in range(N)]
TotalType = set()
for _ in range(N):
t, d = list(map(int, input().split()))
Sushi[_] = [d, t]
Sushi.sort(reverse = True)
ChosenType = set()
Double = []
... | import sys
def solve():
input = sys.stdin.readline
N, K = list(map(int, input().split()))
S = []
for _ in range(N):
t, d = list(map(int, input().split()))
S.append((d, t))
S.sort(reverse = True)
upperKCount = 0
appeared = set()
maxPoint = 0
for i in rang... | p03148 |
def get_point(l):
deli = 0
kind = set()
for x in l:
kind = kind | set([x[0]])
deli += x[1]
point = deli + len(kind) * len(kind)
return point, kind
def remove_deplicated_kind(l, kind):
l = [[x[0], x[1]] for x in l if x[0] not in kind]
return l
def replace_data(curr, rest):
... | import sys
def point(sushi, n, k):
sushi = sorted(sushi, key=lambda x:-x[1])
ate_t = set()
dpoint = 0
dup = []
for s in sushi[:k]:
t = s[0]
d = s[1]
if t in ate_t:
dup.append(d)
ate_t.add(t)
dpoint += d
ans = len(ate_t)**2 + dpoint
for s in sushi[k:]:
... | p03148 |
N, K = list(map(int, input().split()))
sushi = [list(map(int, input().split())) for _ in range(N)]
sushi = sorted(sushi, key=lambda x: x[1], reverse=True)
typ = []
lstA = []
lstB = []
for item in sushi:
if item[0] in typ:
item[0] = 0
lstB.append(item[1])
else:
typ.append(item[... | N, K = list(map(int, input().split()))
sushi = [list(map(int, input().split())) for _ in range(N)]
sushi = sorted(sushi, key=lambda x: x[1], reverse=True)
typ = set()
lstA = []
lstB = []
for item in sushi:
if item[0] in typ:
item[0] = 0
lstB.append(item[1])
else:
typ.add(item[... | p03148 |
N,K = list(map(int,input().split()))
A = sorted([list(map(int,input().split())) for _ in range(N)],key=lambda x:x[1],reverse=True)
C = {}
tot1 = 0
for i in range(K):
t,d = A[i]
if t not in C:
C[t] = 0
C[t] += 1
tot1 += d
tot2 = len(C)
tot = tot1+tot2**2
cur = K
for i in range(K-1,-1... | N,K = list(map(int,input().split()))
A = sorted([list(map(int,input().split())) for _ in range(N)],key=lambda x:x[1],reverse=True)
C = {}
tot1 = 0
for i in range(K):
t,d = A[i]
if t not in C:
C[t] = 0
C[t] += 1
tot1 += d
tot2 = len(C)
tot = tot1+tot2**2
cur = K
for i in range(K-1,-1... | p03148 |
import heapq
N, K = list(map(int, input().split()))
sushi = []
for i in range(N):
t, d = list(map(int, input().split()))
heapq.heappush(sushi, (-d, t))
total = 0
types = []
remain = []
for i in range(K):
d, t = heapq.heappop(sushi)
total -= d
if t not in types:
types.append(... | import heapq
N, K = list(map(int, input().split()))
sushi = []
for i in range(N):
t, d = list(map(int, input().split()))
heapq.heappush(sushi, (-d, t))
total = 0
types = set()
remain = []
for i in range(K):
d, t = heapq.heappop(sushi)
total -= d
if t not in types:
types.add(... | p03148 |
n,k=list(map(int, input().split()))
a=sorted([list(map(int, input().split())) for i in range(n)], key=lambda x:-x[1])
q=[]
ans=0
s=set()
for i in range(k):
ans+=a[i][1]
if a[i][0] in s:
q.append(a[i][1])
s.add(a[i][0])
ans+=len(s)**2
k1=k
ans1=ans
while k1<n and q:
if a[k1][0] not ... | N, K = list(map(int, input().split()))
TD = sorted([list(map(int, input().split())) for i in range(N)], key=lambda x: -x[1])
q = []
ans = 0
s = set()
for i in range(K):
ans += TD[i][1]
if TD[i][0] in s:
q.append(TD[i][1])
s.add(TD[i][0])
ans += len(s) ** 2
k1 = K
ans1 = ans
while k1 < N... | p03148 |
from collections import defaultdict as dd
from heapq import heappop, heappush
N, K = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(N)]
l.sort(key=lambda x:-x[1])
used = set()
q1 = dd(list)
q2, q3 = [], []
score, kind = 0, 0
for t, d in l[:K]:
score += d
if... | from collections import defaultdict as dd
from heapq import heappop, heappush
N, K = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(N)]
l.sort(key=lambda x:-x[1])
used = set()
q1 = dd(list)
q2, q3 = [], []
score, kind = 0, 0
for t, d in l[:K]:
score += d
if... | p03148 |
from collections import defaultdict
from heapq import heappop, heappush
N, K = list(map(int, input().split()))
TD = []
for _ in range(N):
TD.append(tuple(map(int, input().split())))
TD.sort(key = lambda x:x[1], reverse=True)
TD += [(TD[-1][0], 0)]
D = defaultdict(list)
T = [0]*N
H = []
ans = 0
f... | from collections import defaultdict
from heapq import heappop, heappush
N, K = list(map(int, input().split()))
TD = []
for _ in range(N):
TD.append(tuple(map(int, input().split())))
TD.sort(key = lambda x:x[1], reverse=True)
TD += [(TD[-1][0], 0)]
D = defaultdict(list)
T = [0]*N
H = []
ans = [0]
... | p03148 |
from collections import deque
n,k= list(map(int,input().split()))
td=[]
for i in range(n):
td.append(list(map(int,input().split())))
td.sort(key=lambda x:x[1],reverse=True)
select=[]
noselect=[]
cat=[]
for tdi in td:
if tdi[0] in cat:
noselect.append(tdi)
continue
select.appen... | n,k= list(map(int,input().split()))
td=[]
for _ in range(n):
td.append(list(map(int,input().split())))
td.sort(key=lambda x:x[1],reverse=True)
NEW=[1]*(n+1)
x=0
y=0
TOP=[]
SUB=[]
A=[]
for tdi in td[:k]:
if NEW[tdi[0]]==1:
NEW[tdi[0]]=0
TOP.append(tdi[1])
y+=1
else:
... | p03148 |
import queue
from collections import Counter
from operator import itemgetter
N, K = list(map(int, input().split()))
td = sorted([list(map(int, input().split())) for i in range(N)], key=itemgetter(1), reverse=True)
group = queue.PriorityQueue()
count = Counter()
ans = 0
for t, d in td[:K]:
group.put([d,... | import heapq
N, K = list(map(int, input().split()))
td = []
td_ = []
group = set()
total = 0
for i in range(N):
t, d = list(map(int, input().split()))
heapq.heappush(td, (-d, t))
for i in range(K):
d, t = heapq.heappop(td)
total -= d
if t not in group:
group.add(t)
el... | p03148 |
n,k=list(map(int,input().split()))
a=sorted([list(map(int,input().split())) for i in range(n)],reverse=True,key=lambda x: x[1])
type=set([a[i][0] for i in range(k)])
dsum=sum([x[1] for x in a[:k]])
tnum=dict()
for i in [x[0] for x in a[:k]]:
if i not in list(tnum.keys()):
tnum[i]=1
else:tnum[i]+... | n, k = list(map(int, input().split()))
td = sorted([list(map(int, input().split())) for i in range(n)], reverse=True, key=lambda x: x[1])
type = set()
L = []
Sum = 0
for x in td[:k]:
Sum += x[1]
if x[0] not in type:
type.add(x[0])
else:
L.append(x[1])
L = L[::-1]
type_cnt = l... | p03148 |
N,K = list(map(int,input().split()))
s = [list(map(int,input().split())) for l in range(N)]
ans = []
s.sort(key = lambda x:x[1],reverse = True)
cnt = {}
A = 0
for i in range(K):
if s[i][0] not in cnt:
cnt[s[i][0]] = 1
else:
cnt[s[i][0]] += 1
ans.append(s[i])
A += s[i][1]
A +... | N, K = [int(_) for _ in input().split()]
TD = [[int(_) for _ in input().split()] for i in range(N)]
# print(TD)
xs = sorted(TD, key=lambda x:-x[1])
#print(xs)
baset = 0
ts = set()
ds = []
for t, d in xs[:K]:
baset += d
if not t in ts:
ts.add(t)
else:
ds.append(d)
... | p03148 |
import heapq as h;I=lambda:list(map(int,input().split()));n,k=I();z=[i*2+1for i in range(n)];s=sorted([I()for _ in[0]*n],key=lambda x:-x[1]);q=[];v=A=0;l=[0]*-~n
for a,b in s[:k]:
if l[a]:h.heappush(q,b)
else:A+=z[v];v+=1
l[a]=1;A+=b
T=A
for a,b in s[k:]:
if l[a]^1and q:l[a]=1;T+=b+z[v]-h.heappop(q);v+=1;A=m... | import heapq as h;I=lambda:list(map(int,input().split()));n,k=I();z=[i*2+1for i in range(n)];s=sorted([I()for _ in[0]*n],key=lambda x:-x[1]);q=[];v=T=A=0;l=[0]*-~n
for i,(a,b)in enumerate(s):
if i<k:
if l[a]:h.heappush(q,b)
else:T+=z[v];v+=1
l[a]=1;T+=b
elif l[a]^1and q:l[a]=1;T+=b+z[v]-h.heappop(q);v+=1
... | p03148 |
import heapq as h;I=lambda:list(map(int,input().split()));n,k=I();z=[i*2+1for i in range(n)];s=sorted([I()for _ in[0]*n],key=lambda x:-x[1]);q=[];v=i=T=A=0;l=[0]*-~n
for a,b in s:
if i<k:
if l[a]:h.heappush(q,b)
else:T+=z[v];v+=1
l[a]=1;T+=b
elif l[a]^1and q:l[a]=1;T+=b+z[v]-h.heappop(q);v+=1
A=max(A,T)... | import heapq as h;I=lambda:list(map(int,input().split()));n,k=I();z=[i*2+1for i in range(n)];q=[];v=i=T=A=0;l=[0]*-~n
for a,b in sorted([I()for _ in[0]*n],key=lambda x:-x[1]):
if i<k:
if l[a]:h.heappush(q,b)
else:T+=z[v];v+=1
l[a]=1;T+=b
elif l[a]^1and q:l[a]=1;T+=b+z[v]-h.heappop(q);v+=1
A=max(A,T);i+=... | p03148 |
import sys
input = sys.stdin.readline
from operator import itemgetter
import heapq
n, k = list(map(int, input().split()))
TD = sorted([list(map(int, input().split())) for _ in range(n)], reverse=True, key=itemgetter(1))
L = [[] for _ in range(n+1)]
P = []
a = 0
cnt = 0
F = [-float("inf")]*(n+1)
B = 0
for t,... | import sys
input = sys.stdin.readline
from operator import itemgetter
import heapq
n, k = list(map(int, input().split()))
TD = sorted([list(map(int, input().split())) for _ in range(n)], reverse=True, key=itemgetter(1))
L = [[] for _ in range(n+1)]
P = []
a = 0
cnt = 0
F = [-float("inf")]*(n+1)
for t, d in T... | p03148 |
def p_d():
from collections import defaultdict
from heapq import heappush, heappop
N, K = list(map(int, input().split()))
li = []
for _ in range(N):
t, d = list(map(int, input().split()))
li.append((t, d))
li.sort(key=lambda x: x[1], reverse=True)
sushi = defaultdict... | def p_d():
N, K = list(map(int, input().split()))
inf = 10 ** 18
sushi = [[-inf] for _ in range(N)]
max_kind = -1
for _ in range(N):
t, d = list(map(int, input().split()))
sushi[t - 1].append(d)
if max_kind < t:
max_kind = t
for i in range(max_kind):... | p03148 |
from collections import Counter
N,K = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
src.sort(key=lambda x:-x[1])
selected = Counter()
ans = 0
stack = []
for t,d in src[:K]:
ans += d
selected[t] += 1
stack.append((t,d))
ans += len(selected)**2
tmp ... | N,K = list(map(int,input().split()))
TD = [tuple(map(int,input().split())) for i in range(N)]
TD.sort(key=lambda x:x[1])
import heapq
hq = []
heapq.heapify(hq)
selected = set()
ans = 0
for _ in range(K):
t,d = TD.pop()
if t in selected:
heapq.heappush(hq, d)
else:
selected.add... | p03148 |
from itertools import permutations
N, K = list(map(int, input().split()))
inputs = [[int(i) for i in input().split()] for _ in range(N)]
ans = 0
for items in permutations(inputs, K):
tmp = 0
sets = set()
for i in range(K):
tmp += items[i][1]
sets.add(items[i][0])
tmp += len... | N, K = list(map(int, input().split()))
inputs = []
priority_queue = []
queue = []
sets = set()
for _ in range(N):
key, value = list(map(int, input().split()))
inputs.append((value, key))
inputs.sort(reverse=True) # valueで降順のソートをかけてる
for i in range(K):
value, key = inputs[i]
if key in ... | p03148 |
import itertools
N, K = list(map(int, input().split()))
data = [list(map(int, input().split())) for _ in range(N)]
now = data[:K]
def count(x):
p = len(set([a[0] for a in x]))
point = p ** 2
p = sum([a[1] for a in x])
point += p
return point
p_max = count(now)
for i in list(iter... | N, K = list(map(int, input().split()))
data = [list(map(int, input().split())) for _ in range(N)]
data = sorted(data, key=lambda x: x[1], reverse=1)
now = data[:K]
def count(x):
p = len(set([a[0] for a in x]))
point = p ** 2
p = sum([a[1] for a in x])
point += p
return point
p_... | p03148 |
from collections import Counter
import heapq
n ,k = list(map(int, input().split()))
used = []
unused = []
for i in range(n):
t, d = list(map(int, input().split()))
unused.append((-d,t))
heapq.heapify(unused)
# 最初の集合
c = Counter()
ans = []
kiso = 0
for i in range(k):
d, t = heapq.heappop(unus... | #参考 https://atcoder.jp/contests/abc116/submissions/4059000
n, k = list(map(int,input().split()))
# 価値の大きい順にソート, おいしさが前に来るようにした
sushi = sorted(list(map(int, input().split()))[::-1] for i in range(n))[::-1]
s = set()
# 二個以上あるものの集合があれば良い,かつ最小順
q = []
kiso = 0
for i in range(k):
d, t = sushi[i]
if t in s:... | p03148 |
from heapq import heappush, heappop
N, K = list(map(int, input().split()))
TD = [list(map(int, input().split())) for _ in range(N)]
TD.sort(key=lambda x:x[1], reverse=True)
muptiple = set()
hp = []
for t, d in TD:
flg = 0
if t not in muptiple:
muptiple.add(t)
flg = 1
heappush(hp, ... | from heapq import heappush, heappop
N, K = list(map(int, input().split()))
TD = [list(map(int, input().split())) for _ in range(N)]
TD.sort(key=lambda x:x[1], reverse=True)
muptiple = set()
for i in range(len(TD)):
flg = 0
if TD[i][0] not in muptiple:
muptiple.add(TD[i][0])
flg = 1
... | p03148 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
sushi_array = []
sushi_count = [-1] * N
sushi_kind = 0
for i in range(N):
t, d = list(map(int, input().split()))
sushi_array.append([t - 1, d])
if sushi_count[t - 1] == -1:
sushi_count[t - 1] = 0
sush... | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
sushi_array = []
sushi_count = [-1] * N
sushi_kind = 0
for i in range(N):
t, d = list(map(int, input().split()))
sushi_array.append([t - 1, d])
if sushi_count[t - 1] == -1:
sushi_count[t - 1] = 0
sush... | p03148 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
sushi_array = []
sushi_count = [-1] * N
sushi_kind = 0
for i in range(N):
t, d = list(map(int, input().split()))
sushi_array.append([t - 1, d])
if sushi_count[t - 1] == -1:
sushi_count[t - 1] = 0
sush... | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
sushi_array = []
sushi_count = [-1] * N
sushi_kind = 0
for i in range(N):
t, d = list(map(int, input().split()))
sushi_array.append([t - 1, d])
if sushi_count[t - 1] == -1:
sushi_count[t - 1] = 0
sush... | p03148 |
import collections
import heapq
import operator
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in r... | import collections
import heapq
import operator
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in r... | p03148 |
import collections
import heapq
import operator
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in r... | import heapq
import operator
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lam... | p03148 |
from collections import defaultdict
import heapq
def main():
N, K = list(map(int, input().split(' ')))
sushi_list = [list(map(int, input().split(' '))) for _ in range(N)] # list of (neta, oishisa)
sushi_list.sort(key=lambda x: x[1], reverse=True) # sort by oishisa
# check sushi with top K oi... | def main():
N, K = list(map(int, input().split()))
sushi_list = list()
for _ in range(N):
t, d = list(map(int, input().split()))
t -= 1
sushi_list.append((t, d))
sushi_list.sort(key=lambda s: s[1], reverse=True) # おいしさの降順でソート
# おいしさTop Kのすしをとるのを初期解とする
neta_flag_... | p03148 |
import collections
n, k = list(map(int, input().split()))
h = []
for i in range(n):
a, b = list(map(int, input().split()))
h.append((a,b))
h.sort(key=lambda x: -x[1])
fav=h[0:k]
tb={}
for t,d in sorted(h[k:], key=lambda x: (-x[0], -x[1])):
tb[t] = tb.get(t, []) + [d]
alt = []
for t,ds in list(... | n, k = list(map(int, input().split()))
h = []
for i in range(n):
t, d = list(map(int, input().split()))
h.append((t,d))
h.sort(key=lambda x: -x[1])
taste = 0
typen = 0
typecnt = {}
bad = []
for i in range(k):
typecnt[h[i][0]] = typecnt.get(h[i][0], 0) + 1
if(typecnt[h[i][0]] == 1):
... | p03148 |
import itertools
N, K = list(map(int, input().split()))
menu = {}
for i in range(N):
t, d = list(map(int, input().split()))
menu[i] = (t, d)
def manzoku(s):
manzoku = sum([menu[i][1] for i in s]) + len(set([menu[i][0] for i in s]))**2
return manzoku
#K sushi
shushi = itertools.combinat... | N, K = list(map(int, input().split()))
menu_ = []
for i in range(N):
t, d = list(map(int, input().split()))
menu_.append((t, d))
menu = sorted(menu_, key = lambda x:x[1], reverse=True)
neta = set()
duplicates = []
for m in menu[:K]:
if m[0] in neta:
duplicates.append(m[1])
else:... | p03148 |
N, K = list(map(int, input().split()))
nums = [[] for i in range(N)]
for i in range(N):
t, d = list(map(int, input().split()))
t -= 1
nums[t].append(d)
maxs = []
rest = []
for i in range(N):
nums[i].sort(reverse=True)
if len(nums[i]) > 0:
maxs.append(nums[i][0])
rest = re... | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
nums = [[] for i in range(N)]
for i in range(N):
t, d = list(map(int, input().split()))
t -= 1
nums[t].append(d)
maxs = []
rest = []
for i in range(N):
nums[i].sort(reverse=True)
if len(nums[i]) > 0:
... | p03148 |
import heapq
n,k = list(map(int,input().split()))
L = []
for i in range(n):
t,d = list(map(int,input().split()))
L.append([d,t])
L.sort()
ans = []
cur = [0]*n
heap = []
var = 0
for i in range(k):
if cur[L[n-i-1][1]-1] == 0:
ans.append(L[n-i-1][0])
cur[L[n-i-1][1]-1] = 1
... | import heapq
n,k = list(map(int,input().split()))
L = []
for i in range(n):
t,d = list(map(int,input().split()))
L.append([d,t])
L.sort()
ans = []
cur = [0]*n
heap = []
var = 0
for i in range(k):
if cur[L[n-i-1][1]-1] == 0:
ans.append(L[n-i-1][0])
cur[L[n-i-1][1]-1] = 1
... | p03148 |
import itertools
import heapq
N, K = [int(x) for x in input().split()]
orig_td = [tuple([int(x) for x in input().split()]) for _ in range(N)]
td = sorted(orig_td.copy(), key=lambda x: x[1], reverse=True)
INF = 10**9
# print(td)
def score(a):
kiso = sum([x[1] for x in a])
bonus = len(set([x[0] for x... | N, K = [int(x) for x in input().split()]
td = sorted([[int(x) for x in input().split()] for _ in range(N)],
key=lambda x: x[1], reverse=True)
INF = 10**9
# print(td)
first = []
second = []
kind = set()
for i in range(K):
if td[i][0] not in kind:
first.append(td[i])
kind.add(... | p03148 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap():... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap():... | p03148 |
from heapq import heappop, heappush
n, nTake = list(map(int, input().split()))
a = sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda x: (-x[1], x[0]))
totalTaste = 0
same = []
types = set()
for i in range(nTake):
type, taste = a[i]
totalTaste += taste
if type not in types:... | n, nTake = list(map(int, input().split()))
a = sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda x: -x[1])
totalTaste = 0
same = []
types = set()
for i in range(nTake):
type, taste = a[i]
totalTaste += taste
if type not in types:
types.add(type)
else:
s... | p03148 |
N, K = list(map(int, input().split()))
list0 = []
list1 = []
set1 = set()
td = []
for i in range(N):
t, d = list(map(int, input().split()))
td.append((t, d))
td.sort(key=lambda x: (x[0], -x[1]))
for t, d in td:
if t in set1:
list0.append(d)
else:
set1.add(t)
... | N, K = list(map(int, input().split()))
list0 = []
list1 = []
set1 = set()
td = []
for i in range(N):
t, d = list(map(int, input().split()))
td.append((t, d))
td.sort(key=lambda x: (x[0], -x[1]))
for t, d in td:
if t in set1:
list0.append(d)
else:
set1.add(t)
... | p03148 |
from collections import deque
n,k=list(map(int,input().split()))
td=sorted([list(map(int,input().split())) for i in range(n)],reverse=True,key=lambda x:x[1])
ans=0
kinds=dict()
for i in range(k):
ans+=td[i][1]
if td[i][0] in kinds:
kinds[td[i][0]].append(td[i][1])
else:
kinds[td[... | n,k=list(map(int,input().split()))
td=sorted([list(map(int,input().split())) for i in range(n)],reverse=True,key=lambda x:x[1])
ans=0
kl=dict()
for i in range(k):
ans+=td[i][1]
if td[i][0] in kl:
kl[td[i][0]]+=1
else:
kl[td[i][0]]=1
l=len(kl)
ans+=(l**2)
ans_=ans
now=k-1
for ... | p03148 |
from operator import itemgetter
# 満足ポイントを求める関数
def f(a, b):
return len(a) ** 2 + sum(a) + sum(b)
n, k = list(map(int, input().split()))
sushi = []
for i in range(n):
sushi.append(list(map(int, input().split())))
sushi.sort(key=itemgetter(1), reverse=True)
s = []
s_change = []
types = []
#... | # 入力
n, k = list(map(int, input().split()))
A = [] # 寿司のネタの美味しさと種類を入れるリスト
for _ in range(n):
A.append(list(map(int, input().split())))
# 美味しさ順にソートする
A.sort(key=lambda x: x[1], reverse=True)
# 美味しさで貪欲にとる
X = [] # 同じ種類で他に美味しさの大きい寿司が存在する
Y = [] # 取った寿司の中の各々の種類で美味しさが最も大きい
st = set() # 種類
for i in range(k... | p03148 |
print((sum(len(str(i))%2 for i in range(1, int(eval(input())) + 1))))
| n = int(eval(input()))
i = 1
r = 0
while 10 * i <= n + 1:
r += 9 * i
i *= 100
print((r + max(0, n + 1 - i)))
| p02952 |
from math import log10
n = int(eval(input()))
cnt = 0
for i in range(1,n+1):
if int(log10(i)+1) % 2 != 0 and i <= n:
cnt += 1
print(cnt) | from math import log10
n =int(eval(input()))
print((len([i for i in range(1, n+1) if int(log10(i)+1) % 2 != 0 and i <= n]))) | p02952 |
N = int(eval(input()))
count = 0
for i in range(1, N + 1):
num_dig = 0
ii = i
while ii > 0:
ii = int(ii / 10)
num_dig += 1
if num_dig % 2 != 0:
count += 1
print(count) | N = int(eval(input()))
count = 0
for i in range(1, N + 1):
if len(str(i)) % 2 != 0:
count += 1
print(count) | p02952 |
#!/usr/bin/env python3
n=int(eval(input()))
a=0
for i in range(1,n+1):
if len(str(i))%2>0:
a+=1
print(a)
| print((sum(len(str(-~i))%2>0 for i in range(int(eval(input()))))))
| p02952 |
n = int(eval(input()))
count = 0
for i in range(1,n+1):
if len(str(i)) % 2 == 1:
count += 1
print(count)
|
n = eval(input())
num = int(n)
ans = 0
for i in range(1,num+1):
if len(str(i)) % 2 == 1:
ans += 1
# print(i)
print(ans)
| p02952 |
N = int(eval(input()))
answer = 0
for x in range(1,N+1):
if len(str(x)) & 1:
answer += 1
print(answer) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
answer = sum(len(str(x))&1 for x in range(1,N+1))
print(answer) | p02952 |
N = int(eval(input()))
count = 0
for i in range(1, N+1):
s = str(i)
if len(s) % 2 == 1:
count += 1
print(count) | def main():
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
s = str(i)
if(len(s) % 2 == 1): ans +=1
return ans
if __name__ == '__main__':
print((main())) | p02952 |
# 単純にすべてをまわして桁数を計算したのでよかったらしい
n = int(eval(input()))
ans = 0
for i in range(1, n+1):
if len(str(i)) % 2 == 1:
ans += 1
print(ans)
| n = eval(input())
digit_n = len(str(n))
n = int(n)
ans = 0
if digit_n % 2 == 0:
for i in range(digit_n // 2):
ans += 9 * 10 ** (i * 2)
else:
if digit_n != 1:
for i in range((digit_n - 1) // 2):
ans += 9 * 10 ** (i * 2)
hasuu = n - 10 ** ((i+1)*2)
ans +... | p02952 |
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if len(list(str(i))) % 2 == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
def count_digit(n: int) -> int:
digit = 0
while n:
digit += 1
n //= 10
return digit
def main():
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if count_digit(i) % 2 == 1:
ans += 1
print(ans)
... | p02952 |
N = int(eval(input()))
i = 1
cnt = 0
while i <= N:
cnt += 1
i += 1
if len(str(i)) % 2 == 0:
i *= 10
print(cnt) | N = int(eval(input()))
cnt = 0
i = 0
for i in range(0, 5, 2):
m = 10 ** i
if len(str(m)) > len(str(N)):
break
M = int("9" * (i + 1))
if M > N:
M = N
cnt += M - m + 1
print(cnt) | p02952 |
n = int(eval(input()))
num = 0
for i in range(n):
if len(str(i+1))%2 == 1:
num += 1
print(num) | n = int(eval(input()))
cnt = 0
for i in range(1,n+1):
s = len(str(i))
if s%2 == 1:
cnt +=1
print(cnt) | p02952 |
# 2019-11-16 10:55:08(JST)
import sys
# import collections
import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# ... | import sys
n = sys.stdin.readline().rstrip()
l = len(n)
def main():
cnt = 0
for i in range(0, l, 2):
if i < l-1:
cnt += 10 ** (i + 1) - 10 ** i
else:
cnt += int(n) - (10 ** i - 1)
return cnt
if __name__ == '__main__':
ans = main()
print(an... | p02952 |
# ABC 136: B – Uneven Numbers
n = int(eval(input()))
odd_digits = 0
for i in range(1, n + 1):
if len(str(i)) % 2 != 0:
odd_digits += 1
print(odd_digits) | # ABC 136: B – Uneven Numbers
N = int(eval(input()))
count = 0
for i in range(1, N + 1):
if len(str(i)) % 2 == 1:
count += 1
print(count) | p02952 |
# ABC136b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(eval(input()))
c = 0
for i in range(1, n+1):
if (len(str(i)) % 2 == 1):
c += 1
print(c) | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# map(int, input().split())
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if len(str(i)) % 2 == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02952 |
N = int(eval(input()))
cnt = 0
while N > 0:
s = str(N)
length = len(s)
if length % 2 == 0:
N -= 1
else:
cnt += 1
N -= 1
print(cnt) | N = int(eval(input()))
cnt = 0
for i in range(1, N + 1):
if len(str(i)) % 2 == 1:
cnt += 1
print(cnt) | p02952 |
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
digit = 1
while i//10 > 0:
digit += 1
i /= 10
if digit%2 == 1:
ans += 1
print(ans) | n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if len(str(i))%2 == 1:
ans += 1
print(ans) | p02952 |
n = int(eval(input()))
print((len(list([x for x in range(1,n+1) if len(str(x))%2 == 1])))) | n = int(eval(input()))
gen = (x for x in range(1,n+1) if len(str(x))%2 == 1)
print((len(list(gen)))) | p02952 |
a=0
for i in range(int(eval(input()))):
if len(str(i+1))%2==1:a+=1
print(a) | n=int(eval(input()))
ans=0
for i in range(1, n+1):
if len(str(i))%2 == 1:
ans+=1
print(ans) | p02952 |
n = int(eval(input()))
res = 0
for i in range(1, n + 1):
l = len(str(i))
res += l & 1
print(res) | n = int(eval(input()))
print((sum([len(str(x)) & 1 for x in range(1, n+1)]))) | p02952 |
N = int(eval(input()))
count = 0
for i in range(N):
if len(str(i + 1)) % 2 == 1:
count += 1
print(count) | N = int(eval(input()))
# count = 0
# for i in range(N):
# if len(str(i + 1)) % 2 == 1:
# count += 1
# print(count)
print((sum(1 for i in range(N) if len(str(i + 1)) % 2 == 1))) | p02952 |
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
s = str(i)
if (len(s) % 2 != 0):
ans+=1
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if len(str(i)) % 2 != 0:
ans += 1
print(ans)
| p02952 |
import math
n = int(eval(input()))
cnt = 0
for i in range(1, n + 1):
if math.floor(math.log10(i) + 1) % 2:
cnt += 1
print(cnt) | n = int(eval(input()))
cnt = 0
for i in range(1, n + 1):
if len(str(i)) % 2:
cnt += 1
print(cnt) | p02952 |
n = int(eval(input()))
cnt = 0
for i in range(1, n + 1):
if len(str(i)) % 2:
cnt += 1
print(cnt) | n = int(eval(input()))
print((sum(len(str(i + 1)) % 2 for i in range(n)))) | p02952 |
N = int(eval(input()))
s = 0
for i in range(1, N+1):
if len(str(i))%2 == 1:
s = s+1
print (s) | N = int(eval(input()))
s = len(str(N))
t = 0
for i in range(0,s//2):
t = t+9*10**(i*2)
if s%2 == 1:
t = t+N-10**(s-1)+1
print (t) | p02952 |
N = int(eval(input()))
cnt = 0
for i in range(1,N+1):
if len(str(i)) %2 != 0:
cnt+=1
print(cnt) | N = int(eval(input()))
cnt = 0
for i in range(1,N+1):
if len(str(i))%2==1:
cnt+=1
print(cnt) | p02952 |
N=int(eval(input()))
ans=0
for i in range (1,N+1):
if len(str(i))%2==1:
ans +=1
ans=int(ans)
print(ans) | N = int(eval(input()))
cnt=0
for i in range(1,N+1):
a = len(str(i))
if a%2==1:
cnt +=1
print(cnt)
| p02952 |
import math
def digits(n):
return int(math.log10(n))+1
def main():
n = int(eval(input()))
n_digit = digits(n)
ans = 0
if n_digit%2==0:
for i in range(n_digit-1,0,-2):
ans = ans + (pow(10,i)-pow(10,i-1))
else:
ans = n - pow(10,n_digit-1) + 1
for i in range(n_digit-2,0,... | n = int(eval(input()))
import math
digit = int(math.log10(n))+1
ans = 0
if digit%2==0:
for i in range(digit-1,0,-1):
if i%2!=0: ans += (10**i-10**(i-1))
print(ans)
else:
ans = n-10**(digit-1)+1
for i in range(digit-2,0,-1):
if i%2!=0: ans += (10**i-10**(i-1))
print(ans)
| p02952 |
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
if len(str(i)) % 2 == 1:
ans += 1
print(ans) | #!/usr/bin/env python3
import sys
def solve(N: int):
result = 0
for i in range(1, N + 1):
if len(str(i)) % 2 != 0:
result += 1
print(result)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You c... | p02952 |
n = eval(input(''))
n = int(n)
result = []
for i in range(1,n+1):
if len(str(i)) % 2 !=0:
result.append(i)
print((len(result))) | n = int(eval(input()))
result = []
for i in range(1,n+1):
if len(str(i)) % 2 != 0:
result.append(i)
print((len(result))) | p02952 |
N = int(eval(input()))
cnt = 0
for i in range(1,N+1):
if len(str(i))%2 == 1:
cnt += 1
print(cnt) | print((sum([1 for i in range(1,int(eval(input()))+1) if len(str(i))%2==1])))
| p02952 |
def f(x):
res = 0
while x > 0:
x //= 10
res += 1
return res
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if f(i) % 2 == 1:
ans += 1
print(ans)
| n = int(eval(input()))
print((len(tuple([x for x in range(1, n + 1) if len(str(x)) % 2 == 1]))))
| p02952 |
N = int(eval(input()))
ans = sum(len(str(i)) % 2 == 1 for i in range(1, N + 1))
print(ans)
| N = int(eval(input()))
ans = min(9, N) + max(0, min(999, N) - 99) + max(0, min(99999, N) - 9999)
print(ans)
| p02952 |
N = int(eval(input()))
c = 0
for i in range(1,N + 1):
if len(str(i))%2 == 1:
c += 1
print(c)
| n=int(eval(input()))
c=0
for i in range(1,n+1):
if len(str(i))%2!=0:
c+=1
print(c)
| p02952 |
n=int(eval(input()))
c=0
for i in range(1,n+1):
if len(str(i))%2!=0:
c+=1
print(c)
| n=int(eval(input()))
print((sum(len(str(i))%2 for i in range(1,n+1)))) | p02952 |
a=int(eval(input()))
lis=[]
for i in range(1,a+1):
lis.append(str(i))
cnt=0
for i in lis:
if len(i)%2==1:
cnt+=1
print(cnt) | n=int(eval(input()))
ans=0
for i in range(1,n+1):
i=str(i)
if len(i)%2==1:
ans+=1
print(ans) | p02952 |
N = int(eval(input()))
count = 0
for i in range(1, N+1):
s = str(i)
if len(s) % 2 == 1:
count += 1
print(count) | def I(): return int(eval(input()))
N = I()
ans = 0
for i in range(1,N+1):
if len(str(i))%2==1:
ans += 1
print(ans)
| p02952 |
#!/usr/bin/env python
def main(N):
ans = 0
for i in range(1, N+1):
if len(str(i)) % 2 == 1:
ans += 1
return(ans)
if __name__ == '__main__':
N = int(eval(input()))
print((main(N)))
| #!/usr/bin/env python
def main():
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if len(str(i)) %2 == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02952 |
N = int(eval(input()))
count = 0
for i in range(1, N+1):
if len(str(i)) % 2 == 1:
count += 1
print(count) | def resolve():
N = int(input())
ans = 0
for i in range(1, N+1):
s = str(i)
if len(s)%2 == 0:
continue
ans += 1
return print(ans)
if __name__ == "__main__":
resolve()
| p02952 |
ans = 0
for i in range(1, int(eval(input()))+1):
if((1<=i and i<=9)or(i>=100 and i<=999)or(i>=10000 and i<=99999)):
ans += 1
print(ans) | ans = 0
for i in range(1, int(eval(input()))+1):
if((1<=i<=9)or(100<=i<=999)or(10000<=i<=99999)):
ans += 1
print(ans) | p02952 |
n_str = eval(input())
n_int = int(n_str)
# 1 ~ 50000
# 桁数が奇数= 1桁, 3桁, 5桁
# 1 ~ 9, 100 ~ 999,10000 ~ 99999の90909個しかないので全探索いけるか?
exs_list = []
for i in range(1, 100000):
if len(str(i)) % 2 == 1:
exs_list.append(i)
exs = {i: i for i in exs_list}
n_s = []
ans = 0
for i in range(1, n_int + 1):
... | def digit_sum(n):
# 各桁の和を求める
# 計算量: O(logN)
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
n = int(eval(input()))
cnt = 0
for i in range(1, n+1):
cnt += digit_sum(i) % 2
print(cnt)
| p02952 |
N=int(eval(input()))
count=0
for i in range(1,N+1):
if len(str(i))%2==1:count+=1
print(count) | N=int(eval(input()))
print((sum(len(str(i))%2==1 for i in range(1,N+1)))) | p02952 |
N=int(eval(input()))
print((sum(len(str(i))%2==1 for i in range(1,N+1)))) | N=int(eval(input()))
print((sum(len(str(i))%2 for i in range(1,N+1)))) | p02952 |
n = int(eval(input()))
count= 0
for i in range(1,n+1):
if len(str(i)) == 1 or len(str(i)) == 3 or len(str(i)) == 5:
count+=1
print(count) | n = int(eval(input()))
count= 0
for i in range(1,n+1):
if len(str(i))%2 == 1:
count+=1
print(count) | p02952 |
print((sum(len(str(x+1))%2for x in range(int(eval(input())))))) | print(sum(len(str(x+1))%2for x in range(eval(input())))) | p02952 |
n = int(eval(input()))
def countKeta(num):
count = 1
while num / 10 >= 1:
count += 1
num = num // 10
return count
count = 0
for i in range(1, n+1):
if(countKeta(i) % 2 == 1):
count += 1
print(count) | n = int(eval(input()))
if n < 10:
print(n)
elif n < 100:
print((9))
elif n < 1000:
print((n-90))
elif n < 10000:
print((909))
elif n < 100000:
print((n-9090))
elif n < 1000000:
print((90909)) | p02952 |
N = int(eval(input()))
hako = []
ans = 0
for i in range(N):
hako.append(N-i)
for k in range(N):
nakami = hako[k]
if len(str(nakami))%2 >= 1:
ans += 1
print(ans)
| count = 0
S=int(eval(input()))
for i in range(1,S+1):
if len(str(i))%2==1:
count +=1
print(count)
| p02952 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.