input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
P = list(map(int, input().split(' ')))
print((sum(1 for i in range(1, N) if P[i] <= min(P[0:i])) + 1)) | N = int(eval(input()))
P = list(map(int, input().split(' ')))
cnt = 1
j = P[0]
for i in range(1, N):
j = min(j, P[i])
if P[i] <= j:
cnt += 1
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
partP = P[:i+1]
flag = True
partP = sorted(partP)[::-1]
for p in partP:
if P[i] <= p:
continue
else:
flag = False
break
if flag:
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
ans =1
newP = P[0]
for i in range(1, N):
newP = (min(newP, P[i]))
if newP == P[i]:
ans += 1
print(ans) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
count=0
for i in range(1,N):
if P[i]==min(P[0:i+1]):
count+=1
print((count+1))
| N=int(eval(input()))
P=list(map(int,input().split()))
count=0
min=2*10**5
for i in range(N):
if P[i]<=min:
min=P[i]
count+=1
print(count)
| p02791 |
n = int(eval(input()))
li = list(map(int, input().split()))
tmpMinIndex = li.index(1)
count = 1
while True:
if tmpMinIndex == 0:
break
li = li[0:tmpMinIndex]
minNum = min(li)
tmpMinIndex = li.index(minNum)
count += 1
print(count) | n = int(eval(input()))
li = list(map(int, input().split()))
tmpMin = li[0]
count = 0
for i in range(n):
if li[i] <= tmpMin:
tmpMin = li[i]
count += 1
print(count)
| p02791 |
from collections import deque
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
s=deque()
for i in p:
s.append(i)
if min(s)==i:
cnt+=1
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
min=p[0]
for i in p:
if i<=min:
cnt+=1
min=i
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
c = 0
for i in range(N):
f = True
pi = P[i]
for j in range(i):
if pi>P[j]:
f = False
break
if f:
c += 1
print(c) | N = int(eval(input()))
P = list(map(int,input().split()))
c = 1
pmin = 1000000
for i in range(1,N):
if P[i-1]<pmin:
pmin = P[i-1]
if pmin >= P[i]:
c += 1
print(c) | p02791 |
n=int(eval(input()))
l=[int(i) for i in input().split()]
c=0
for i in range(n):
c1=min(l[:i+1])
if(l[i]==c1):
c+=1
print(c) | n=int(eval(input()))
l=[int(i) for i in input().split()]
l1=[]
c=0
l1.append(l[0])
for i in range(1,n):
l1.append(min(l1[i-1],l[i]))
for i in range(n):
if(l[i]==l1[i]):
c+=1
print(c) | p02791 |
N = int(eval(input()))
List = list(map(int,input().split()))
cut = N
check =0
min = N
for i in range(1,N+1):
if List[i-1]<=min:
min = List[i-1]
for k in range(1,i+1):
if List[k-1]<List[i-1]:
check = 1
break
if check==1:
cut -= 1
check = 0
else:
cut -=1
print(cut) | N = int(eval(input()))
List = list(map(int,input().split()))
cut = N
check =0
min = N
for i in range(1,N+1):
if List[i-1]<=min:
min = List[i-1]
else:
cut -=1
print(cut)
| p02791 |
n, = (int(x) for x in input().split())
p = list(int(x) for x in input().split())
x = 0
for i in range(n):
for j in range(i+1):
if p[i] > p[j]:
break
if i == j:
x += 1
print(x) | n, = (int(x) for x in input().split())
p = list(int(x) for x in input().split())
x = 0
m = 1e6
for i in range(n):
if p[i] <= m:
x += 1
m = p[i]
print(x) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
def f(l):
left = 0
right = i + 1
while left + 1 < right:
x = (left + right) // 2
if test(x):
left = x
else:
right = x
ans = 1
for i in range(1, N):
tmp = sorted(P[:i])
if tmp[0] >= P[i]:
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
v = P[0]
for i in P:
if i <= v:
ans += 1
v = i
print(ans)
| p02791 |
def main():
N = int(eval(input()))
P = list(map(int,input().split()))
cnt = 1
for i in range(1, N):
# Pi
# P[0:i]
Q = P[0:i]
if P[i] > min(P[0:i]):
cnt = cnt
else:
cnt += 1
#Q = [ _ for _ in P[0:i] if P[i] <= _ ] # TLE
#for _ in P[0:i+1]:
# print(_)
#if len(Q) == i:
# cnt += 1
print(cnt)
main() | def main():
N = int(eval(input()))
P = list(map(int,input().split()))
cnt = 0
Q = max(P)
for i in range(N):
if Q >= P[i]:
cnt += 1
Q = P[i]
print(cnt)
main() | p02791 |
n=int(eval(input()))
p=list(map(int, input().split()))
count=1
if not n==1:
for i in range(1, n):
for j in range(i):
if not p[i] <= p[j]:
break
elif j==i-1:
count+=1
print(count)
else:
print((1)) | n=int(eval(input()))
p=list(map(int, input().split()))
min=200000
count=0
for i in range(n):
if p[i] <= min:
min=p[i]
count+=1
print(count) | p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
for i, p in enumerate(p_list):
if p == min(p_list[:i+1]): ans += 1
print(ans) | n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
m = 10**10
for p in p_list:
if p <= m:
ans += 1
m = p
print(ans) | p02791 |
n = int(eval(input()))
p = list([int(x) for x in input().split()])
count = 1
frag = 0
for i in range(1,n) :
frag = 0
for j in range(i) :
if p[i] > p[j] :
frag = 1
if frag == 0 :
count += 1
print(count)
| n = int(eval(input()))
p = list([int(x) for x in input().split()])
min_list = [p[0]]
count = 1
for i in range(1,n) :
if p[i] < min_list[i - 1] :
min_list.append(p[i])
else :
min_list.append(min_list[i - 1])
for j in range(1,n) :
if p[j] <= min_list[j - 1] :
count += 1
print(count)
| p02791 |
n=int(eval(input()))
ps=list(map(int,input().split()))
cnt=0
for i,p in enumerate(ps):
if min(ps[:i+1])==p:
cnt+=1
print(cnt)
| n=int(eval(input()))
ps=list(map(int,input().split()))
cnt=0
max_=ps[0]
min_=ps[0]
for p in ps:
if min_>=p:
cnt+=1
min_=p
print(cnt)
| p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
count=1
for i in range(1,N):
if(P[i]<min(P[0:i])):
count+=1
else:
pass
print(count) | N=int(eval(input()))
P=list(map(int,input().split()))
count=0
mini=P[0]
for i in range(N):
if(P[i]<=mini):
mini=P[i]
count+=1
else:
pass
print(count) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
ans=n
for i in range(1,n):
for j in range(i):
if p[j]<p[i]:
ans-=1
break
print(ans) | n=int(eval(input()))
p=list(map(int,input().split()))
mini=p[0]
ans=0
for i in range(n):
if p[i]<=mini:
ans+=1
mini=min(p[i],mini)
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1, N):
if P[i] == min(P[:i+1]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
Q = [P[0]]
for i in P[1:]:
if i < Q[-1]:
Q.append(i)
print((len(Q))) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(N-1):
if P[i+1] <= min(P[:i+1]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
lowest = 200000
ans = 0
for num in P:
if num <= lowest:
ans += 1
lowest = min(lowest, num)
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
is_valid = True
for j in range(i+1):
if p[i] > p[j]:
is_valid = False
break
if is_valid:
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
min_value = p[0]
for i in range(n):
if p[i] <= min_value:
ans += 1
min_value = min(p[i], min_value)
print(ans)
| p02791 |
N = int(eval(input()))
P = [int(p_) for p_ in input().split()]
ans = [1]
for i in range(1, len(P)):
#print(i+1, P[0:i], min(P[0:i]), P[i])
if P[i] <= min(P[0:i]):
ans.append(i+1)
print((len(ans))) | N = int(eval(input()))
P = [int(p_) for p_ in input().split()]
ans = [1]
mini = P[0]
for i in range(1, len(P)):
if mini > P[i]:
mini = P[i]
ans.append(i+1)
print((len(ans))) | p02791 |
N=int(eval(input()))
list=list(map(int,input().split()))
A=1
for i in range(N):
for j in range(i+1):
if list[i]>list[j]:
break
else:
if j==i-1:
A+=1
print(A) | N=int(eval(input()))
list=list(map(int,input().split()))
A=1
i=0
j=0
for x in range(N):
if list[i]<list[j]:
A=A+1
j=i
i=i+1
print(A) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
d = {}
m = {}
for i in range(n):
d[i] = p[i]
m[i] = min(p[:i + 1])
for i in range(n):
if p[i] == m[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
pmin = p[0]
for i in range(1, n):
if pmin >= p[i]:
ans += 1
pmin = p[i]
print(ans) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
count = 0
for i in range(n):
if p[i] <= min(p[:i+1]):
count +=1
else:
pass
print(count) | n = int(eval(input()))
p = [int(i) for i in input().split()]
small = p[0]
count = 0
for i in range(n):
if p[i] <= small:
count +=1
else:
pass
small = min(small,p[i])
print(count) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
small = p[0]
count = 0
for i in range(n):
if p[i] <= small:
count +=1
else:
pass
small = min(small,p[i])
print(count) | n = int(eval(input()))
p = [int(i) for i in input().split()]
small = p[0]
count = 0
for i in range(n):
if small >= p[i]:
count +=1
else:
pass
small = min(small,p[i])
print(count) | p02791 |
if __name__=="__main__":
n = int(eval(input()))
args = input().split()
p = []
for i in range(len(args)):
p.append(int(args[i]))
cnt = 1
p_pre = [p[0]]
for i in range(1,len(args)):
p_pre.append(p[i])
if p[i]==min(p_pre):
cnt += 1
print(cnt) | if __name__=="__main__":
n = int(eval(input()))
args = input().split()
p = []
for i in range(len(args)):
p.append(int(args[i]))
cnt = 1
p_pre = [p[0]]
min_p_pre = p[0]
for i in range(1,len(args)):
p_pre.append(p[i])
min_p_pre = min(min_p_pre, p[i])
if p[i] == min_p_pre:
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
p = input().split()
p = [int(i) for i in p]
c = 0
for i in range(n):
for j in range(i):
if p[i] <= p[j]:
continue
else:
break
else:
c += 1
print(c) | n = int(eval(input()))
p = [int(i) for i in input().split()]
'''
選んだ数字(iで場所指定)より、左の数字が全て大きい。
'''
c = 0
MIN = p[0]
for i in range(n):
if p[i] <= MIN:
c += 1
MIN = p[i]
print(c) | p02791 |
n=int(eval(input()))
ct=0
p=list(map(int,input().split()))
for i in range(n):
list1=sorted(p[0:i+1])
if list1[0]==p[i]:
ct+=1
print(ct) | n=int(eval(input()))
ct=0
p=list(map(int,input().split()))
mn=p[0]
for i in range(1,n):
if mn>=p[i]:
ct+=1
mn=p[i]
print((ct+1)) | p02791 |
N=int(eval(input()))
List=list(map(int,input().split()))
ans=0
for i in range(N):
if min(List[:i+1])==List[i]:
ans+=1
print(ans) | N=int(eval(input()))
ans=0
champ=10**6
for p in list(map(int,input().split())):
if p<champ:
ans+=1
champ=p
print(ans) | p02791 |
N = int(eval(input()))
sta = list(map(int, input().split()))
sta2 = []
count_i = 0
for i in sta:
sta2.append(i)
if i <= min(sta2):
count_i += 1
print(count_i) | N = int(eval(input()))
sta = list(map(int, input().split()))
min_i = sta[0]
count_i = 0
for i in sta:
if min_i > i:
min_i = i
if i <= min_i:
count_i += 1
print(count_i) | p02791 |
import sys
from itertools import accumulate
read = sys.stdin.read
N, *P = list(map(int, read().split()))
p = list(accumulate(P, min))
answer = 0
for i, j in zip(P, p):
if i <= j:
answer += 1
print(answer)
| import sys
from itertools import accumulate
read = sys.stdin.read
N, *P = list(map(int, read().split()))
p = accumulate(P, min)
print((sum(i <= j for i, j in zip(P, p))))
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
res = 0
for i in range(len(P)):
if min(P[:i+1]) == P[i]:
res += 1
print(res) | N = int(eval(input()))
P = list(map(int, input().split()))
res = 1
minP = P[0]
for i in range(len(P)-1):
if minP > P[i+1]:
minP = P[i+1]
res += 1
print(res) | p02791 |
n = int(eval(input()))
lis = list(map(int, input().split()))
for a, b in enumerate(lis):
if b != min(lis[:a+1]) :
n -= 1
print(n) | n = int(eval(input()))
lis = list(map(int, input().split()))
inf = 10 ** 15
ans = 0
for i in lis:
if i < inf:
ans += 1
inf = i
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
for i in range(n):
if i == 0:
cnt += 1
else:
if min(p[:i+1]) == p[i]:
cnt += 1
else:
continue
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
min=p[0]
cnt=0
for i in range(n):
if min >= p[i]:
cnt+=1
min=p[i]
else:
continue
print(cnt) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
cnt=0
for i in range(N):
if min(P[:i+1])==P[i]:
cnt+=1
print(cnt) | N=int(eval(input()))
P=list(map(int,input().split()))
cnt=0
mi=P[0]
for i in range(N):
if mi>=P[i]:
cnt+=1
mi=P[i]
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
Nflag = 0
count = 0
for i in range(N,1,-1):
for j in range(i-1,0,-1):
if P[i-1]>P[j-1]:
Nflag = 1
break
if Nflag == 0:
count+=1
Nflag = 0
print((count+1)) | N = int(eval(input()))
P = list(map(int,input().split()))
Nflag = 0
count = 0
tmp = float("inf")
for i in P:
if i<tmp:
tmp=i
else:
count+=1
print((N-count))
| p02791 |
n = int(eval(input()))
li = list(map(int,input().split()))
j = 0
for i in range(1,n+1):
lii = min(li[0:i])
if lii == li[i-1]:
j = j + 1
if lii == 1:
break
print(j) | n = int(eval(input()))
li = list(map(int,input().split()))
i = 0
j = 0
a = 10**6
for i in range(i,n):
a = min(a,li[i])
if a == li[i]:
j = j + 1
print(j) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
un = []
ans = 0
for i, x in enumerate(p):
un.append(x)
if x <= min(un):
ans += 1
print(ans)
| n = int(eval(input()))
ps = list(map(int, input().split()))
m = ps[0]
ans = 0
for p in ps:
m = min(p, m)
if p <= m:
ans += 1
print(ans)
| p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=1
for i in range(1,n):
if p[i]<=min(p[:i]):
cnt+=1
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
cnt=1
a=p[0]
for i in range(1,n):
if p[i] <= a:
a = p[i]
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for n in p:
i = p.index(n)
if n == p[0]:
cnt += 1
elif min(p[:i]) >= n:
cnt += 1
print(cnt) | N = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for n in p:
if n == p[0]:
cnt += 1
min = n
elif min >= n:
cnt += 1
min = n
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
# 最小値更新して越えてたらアウト
resultCount = 0
minNum = P[0]
for i in range(N):
isMitasu = True
if i != 0:
if P[i] > minNum:
isMitasu = False
else:
for j in range(i):
if P[i] > P[j]:
isMitasu = False
# 最小値更新
if P[i] < minNum:
minNum = P[i]
break
if isMitasu:
resultCount += 1
print(resultCount) | N = int(eval(input()))
P = list(map(int, input().split()))
# 最小値更新して越えてたらアウト
resultCount = 0
minNum = P[0]
for i in range(N):
isMitasu = True
if i != 0:
if P[i] > minNum:
isMitasu = False
else:
# 最小値更新
minNum = P[i]
if isMitasu:
resultCount += 1
print(resultCount) | p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
Count = 1
for T in range(1,N):
if P[T]<min(P[:T]):
Count += 1
print(Count) | N = int(eval(input()))
P = [int(x) for x in input().split()]
Count = 1
MIN = P[0]
for T in range(1,N):
if P[T]<MIN:
MIN = P[T]
Count += 1
print(Count) | p02791 |
N = int(eval(input()))
P = [i for i in map(int, input().split())]
count = 0
for i in range(N):
flag = 1
for j in range(i):
if P[i] <= P[j]:
flag = 1
else:
flag = -1
break
if flag == 1:
count += 1
print(count)
| N = int(eval(input()))
P = [i for i in map(int, input().split())]
"""
count = 0
for i in range(N):
flag = 1
for j in range(i):
if P[i] <= P[j]:
flag = 1
else:
flag = -1
break
if flag == 1:
count += 1
print(count)
"""
count = 0
min_ = P[0]
for p in P:
if p <= min_:
count += 1
min_ = p
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
c = 1
for i in range(1, n):
flg = True
for j in range(0, i):
if p[j] < p[i]:
flg = False
break
c += 1 if flg else 0
print(c) | n = int(eval(input()))
p = list(map(int, input().split()))
m = [p[0]]
c = 1
for i in range(1, n):
m.append(min(m[i - 1], p[i]))
if m[i] == p[i]:
c += 1
print(c) | p02791 |
N = int(eval(input()))
P = list(input().split())
times = 0
min_num = N+1
for i in range(len(P)):
safe = True
if min_num < int(P[i]):
continue
min_num = int(P[i])
for j in range(i+1):
if not int(P[i]) <= int(P[j]):
safe = False
if safe:
times += 1
print(times) | N = int(eval(input()))
P = list(input().split())
times = 0
min_num = N+1
for i in range(len(P)):
safe = True
if min_num < int(P[i]):
continue
min_num = int(P[i])
times += 1
print(times) | p02791 |
N=int(eval(input()))
P=list(map(int, input().split()))
a=1
b=0
for i in P:
M=min(P[:a])
if M==i:
b+=1
a+=1
print(b) | _ = eval(input())
p = list(map(int, input().split()))
m = float("inf")
c = 0
for i in p:
c += i <= m
m = min(m, i)
print(c)
| p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
count = 1
for i in range(1, N):
if p[i] < min(p[:i]):
count +=1
print(count) | N = int(eval(input()))
p = list(map(int, input().split()))
count = 1
min = p[0]
for i in range(1, N):
if p[i] < min:
count +=1
min = p[i]
print(count) | p02791 |
N = int(eval(input()))
p = list(map(int , input().split()))
ret = 1
for i in range(1, len(p)):
if min(p[:i]) > p[i]:
ret +=1
print(ret) | N = int(eval(input()))
p = list(map(int , input().split()))
ret = 0
c_min = 2e5
for i in p:
if c_min >= i:
c_min = i
ret+=1
print(ret) | p02791 |
n = eval(input())
p = input().split()
cnt = 0
cn = 0
for i in range(len(p)):
cn = int(p[i])
for j in range(i + 1):
if cn > int(p[j]):
break
if i == j:
cnt += 1
print(cnt) | n = eval(input())
p = input().split()
cnt = 0
tmin = 9999999999999999999999999999
for i in range(len(p)):
tmin = min(tmin,int(p[i]))
if tmin >= int(p[i]):
cnt += 1
print(cnt) | p02791 |
#152
def main():
N = int(eval(input()))
P = list(map(int,input().split()))
count = 1
for i in range(1, N):
p = P[:i]
if(min(p)>=P[i]):
count+=1
print(count)
main() | #152
def main():
N = int(eval(input()))
P = list(map(int,input().split()))
count = 0
min = 10000000000
for p in P:
if(p<=min):
count+=1
min=p
print(count)
main() | p02791 |
c=0
N=int(eval(input()))
L=list(map(int,input().split()))
R=list()
for i in range(N):
R.append(L[i])
if min(R)==L[i]:
c=c+1
print(c) | mina=10**11
c=0
N=int(eval(input()))
L=list(map(int,input().split()))
for i in range(N):
mina=min(mina,L[i])
if mina==L[i]:
c=c+1
print(c) | p02791 |
n=int(eval(input()))
p=[int(x) for x in input().split()]
a=1
for i in range(1,n):
if p[i]<=min(p[:i]):
a+=1
print(a) | n=int(eval(input()))
p=[int(x) for x in input().split()]
a=1
b=p[0]
for i in range(1,n):
if p[i-1]<b:
b=p[i-1]
if p[i]<=b:
a+=1
print(a) | p02791 |
# ABC 152 C
si = lambda: eval(input())
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
snm = lambda: list(map(str, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
p=nl()
s=[]
ans=0
min_v=10**6
for i in range(n):
if i==0:
ans+=1
s.append(p[i])
min_v=min(min_v,p[i])
continue
if p[i]<=min_v:
ans+=1
s.append(p[i])
min_v=min(min_v,p[i])
print(ans) | n=int(eval(input()))
p=list(map(int,input().split()))
min_val=10**18
ans=0
for i in range(n):
if i==0:
min_val=p[i]
ans+=1
continue
if min_val>=p[i]:
min_val=p[i]
ans+=1
print(ans)
| p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
count = 0
check = 0
for i in range(N):
check = 0
for j in range(i):
if P[i] > P[j]:
check = 1
break
if check == 0:
count += 1
print(count)
| N = int(eval(input()))
P = [int(x) for x in input().split()]
count = 0
check = 0
min = 10**9
for i in P:
check = 0
if min > i:
min = i
if i <= min:
count += 1
print(count)
| p02791 |
n = int(eval(input()))
arr = input().split(' ')
arr = [int(i) for i in arr]
count = 0
minimum = arr[0]
for idx in range(n):
num = arr[idx]
if num <= minimum:
minimum = num
count += 1
print(count) | n = int(eval(input()))
arr = input().split(' ')
arr = [int(i) for i in arr]
count = 0
minimum = arr[0]
for num in arr:
if num <= minimum:
minimum = num
count += 1
print(count) | p02791 |
n = int(eval(input()))
arr = input().split(' ')
arr = [int(i) for i in arr]
count = 0
minimum = arr[0]
for num in arr:
if num <= minimum:
minimum = num
count += 1
print(count) | import sys
input = sys.stdin.readline
n = int(eval(input()))
arr = list(map(int,input().split()))
count = 0
minimum = arr[0]
for num in arr:
if num <= minimum:
minimum = num
count += 1
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
res = 0
for i in range(N):
for j in range(i):
if P[i] <= P[j]:
continue
else:
break
else:
res += 1
print(res) | N = int(eval(input()))
P = list(map(int, input().split()))
res = 1
minp = P[0]
for p in P[1:]:
if p < minp:
minp = p
res += 1
print(res) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
ans = 1
tmp = [p[0]]
for i in range(1, n):
tmp.append(p[i])
tmp.sort()
if p[i] <= tmp[0]:
ans += 1
print(ans) | n = int(eval(input()))
p = [int(i) for i in input().split()]
ans = 1
tmp = p[0]
for i in range(1, n):
if tmp >= p[i]:
ans += 1
tmp = p[i]
print(ans) | p02791 |
n = int(eval(input()))
l = list(map(int, input().split()))
s = 0
for i in range(n):
P = l[i]
J = l[:i+1]
if min(J) >= P:
s += 1
print(s)
| n = int(eval(input()))
l = list(map(int, input().split()))
s = 0
m = l[0]
for i in range(n):
if m >= l[i]:
m = l[i]
s += 1
print(s)
| p02791 |
def main():
N = int(eval(input()))
P = tuple(map(int,input().split()))
a = 0
for i in range(N):
hantei = 0
if i == 0:
pass
else:
if min(P[:i]) < P[i]:
hantei = 1
if hantei == 0:
a += 1
print(a)
if __name__ == '__main__':
main() | def main():
N = int(eval(input()))
P = tuple(map(int,input().split()))
a = 1
minP = P[0]
for i in range(1, N):
if minP < P[i]:
pass
else:
minP = P[i]
a += 1
print(a)
if __name__ == '__main__':
main() | p02791 |
#C
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
frag = True
for j in range(i):
if P[i] > P[j]:
frag = False
break
if frag == True:
ans += 1
print(ans) | #C
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min_num = 10**6
for i in range(N):
min_num = min(min_num, P[i])
if min_num >= P[i]:
ans += 1
print(ans) | p02791 |
#C
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min_num = 10**6
for i in range(N):
min_num = min(min_num, P[i])
if min_num >= P[i]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
min_tmp = N+1
ans = 0
for p in P:
if min_tmp >= p:
ans += 1
min_tmp = p
else:
continue
print(ans)
| p02791 |
n = int(eval(input()))
P = list(map(int, (input().split())))
count = 1
for i in range (1, n):
if P[i] <= min(P[:i]):
count += 1
print(count) | n = int(eval(input()))
P = list(map(int, (input().split())))
count = 1
tmp = P[0]
for i in range (1, n):
if P[i] <= tmp:
count += 1
tmp = P[i]
print(count) | p02791 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
count = 0
tmp = A[i]
for j in range(i+1):
if tmp <= A[j]:
count += 1
else:
break
if count == i+1:
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
minv = 10 ** 9
ans = 0
for i in P:
if i < minv:
ans += 1
minv = i
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
p = [0]+p
ansList =[]
for i in range(1,n+1):
if min(p[1:i+1])==p[i]:
ansList.append(p[i])
print((len(ansList))) | n = int(eval(input()))
p = list(map(int,input().split()))
MIN = 10**10
cnt =0
for i in p:
if i<=MIN:
MIN = i
cnt +=1
print(cnt) | p02791 |
n=int(eval(input()))
p=[int(i) for i in input().split()]
for i in range(n):
if i!=0:p[i]=min(p[i-1],p[i])
print((len(set(p))))
| n=int(eval(input()))
p=[int(i) for i in input().split()]
for i in range(1,n):p[i]=min(p[i-1],p[i])
print((len(set(p))))
| p02791 |
n=int(eval(input()))
p=[int(i) for i in input().split()]
for i in range(1,n):p[i]=min(p[i-1],p[i])
print((len(set(p))))
| n=int(eval(input()))
p=list(map(int,input().split()))
for i in range(1,n):p[i]=min(p[i-1],p[i])
print((len(set(p))))
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
# for i in range(1,N):
# # print(P[i],P[i+1])
# if P[i-1] <= P[i]:
# print(i+1)
# exit()
# print(N)
ans = 0
# 各部分列の最小値
minval = max(P)
for i in range(N):
# arr = P[0],...,P[i]の最小値
minval = min(minval,P[i])
arr = P[0:i+1]
# P[i]が最小値以下なら
if P[i] <= minval:
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
# 各部分列の最小値
minval = max(P)
# for i in range(N):
for x in P:
# arr = P[0],...,P[i]の最小値
minval = min(minval,x)
# P[i]が最小値以下なら
if x <= minval:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
minp = min(p[:i + 1])
if p[i] <= minp:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
minp = p[0]
for i in range(n):
if p[i] <= minp:
ans += 1
minp = p[i]
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
minp = p[0]
for i in range(n):
if p[i] <= minp:
ans += 1
minp = p[i]
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
minp = 200000
for i in p:
if i <= minp:
ans += 1
minp = i
print(ans) | p02791 |
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
N=int(eval(input()))
P=list(map(int,input().split()))
A=[]
for i in range(N):
A.append(min(P[:i+1]))
print((len(set(A))))
resolve() | def resolve():
N=int(eval(input()))
P=list(map(int,input().split()))
pmin=P[0]
cnt=0
for i in range(N):
if P[i]<=pmin:
cnt+=1
pmin=P[i]
print(cnt)
resolve() | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
con = 0
for i in range(1,N):
if P[i] <= min(P[:i]):
con += 1
print((con + 1)) | N = int(eval(input()))
P = list(map(int,input().split()))
inf = 10 ** 9
Q = [inf] * N
m = inf
con = 0
for i in range(0,N):
if P[i] <= m:
m = P[i]
Q[i] = m
if P[i] <= Q[i]:
con += 1
print(con) | p02791 |
N = int(eval(input()))
P_list = [int(i) for i in input().split()]
# cnt = 1 # 1件目は必ず合致するので
# for i in range(1,len(P_list)) :
# pi = P_list[i]
# is_match = True
# for j in range(i) : # Pi==Pjは必ず正なのでジャッジ不要
# pj = P_list[j]
# if (pi > pj) :
# is_match = False
# break
# if (is_match) :
# cnt += 1
cnt = 1 # 1件目は必ず合致するので
min_map = [P_list[0]]
for i in range(1,len(P_list)) :
# print(P_list[0:i])
min_value = min(P_list[0:i])
min_map.append(min_value)
# print(min_map)
for i in range(1,len(P_list)) :
if (min_map[i] >= P_list[i]) :
cnt += 1
print(cnt) | N = int(eval(input()))
P_list = [int(i) for i in input().split()]
# cnt = 1 # 1件目は必ず合致するので
# for i in range(1,len(P_list)) :
# pi = P_list[i]
# is_match = True
# for j in range(i) : # Pi==Pjは必ず正なのでジャッジ不要
# pj = P_list[j]
# if (pi > pj) :
# is_match = False
# break
# if (is_match) :
# cnt += 1
cnt = 1 # 1件目は必ず合致するので
min_map = [P_list[0]]
min_value = P_list[0]
for i in range(1,len(P_list)) :
min_value = min(min_value,P_list[i])
min_map.append(min_value)
# print(min_map)
for i in range(1,len(P_list)) :
if (min_map[i] >= P_list[i]) :
cnt += 1
print(cnt) | p02791 |
n=int(eval(input()))
l=list(map(int,input().split()))
f={}
x=1
for i in range(n):
f[x]=l[i]
x+=1
ans=0
for i in range(n):
flag=1
for j in range(i):
if l[i]>l[j]:
flag=0
if flag:
ans+=1
print(ans) | n=int(eval(input()))
l=list(map(int,input().split()))
f={}
x=1
ans=n
min=l[0]
c=0
for i in range(n):
if l[i]<=min:
#ans+=1
min=l[i]
else:
c+=1
#print(l[i])
#print(min)
print((ans-c))
| p02791 |
# ABC 152 C
N = int(eval(input()))
P = list(map(int, input().split()))
res = 0
for i in range(N):
if P[i] <= min(P[:i+1]):
res += 1
else:
continue
print(res) | # ABC 152 C
N = int(eval(input()))
P = list(map(int, input().split()))
res = 0
minP = 10 ** 9
for i in range(N):
if P[i] <= minP:
res += 1
minP = P[i]
else:
continue
print(res) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
index = P[0]
for i in range(1, N):
if index > P[i]:
index = P[i]
ans += 1
print(ans)
| #!/usr/bin/env python3
N = int(eval(input()))
P = list(map(int, input().split()))
M = [0] * N
M[0] = P[0]
m = P[0]
for i in range(1, N):
m = min(P[i], m)
M[i] = m
ans = 0
for i in range(N):
if P[i] <= M[i]:ans+=1
print(ans)
| p02791 |
n=int(eval(input()))
l=list(map(int,input().split()))
cnt=0
for i in range(1,n+1):
if min(l[:i])==l[i-1]:
cnt+=1
print(cnt) | n=int(eval(input()))
l=list(map(int,input().split()))
cnt=0
num=max(l)
for i in l:
num=min(num,i)
if num==i:
cnt+=1
print(cnt)
| p02791 |
import sys
s = sys.stdin.readline().rstrip()
def main():
cnt = 0
for i in range(len(s) - 1):
if s[i] != s[i+1]:
cnt += 1
return cnt
if __name__ == '__main__':
ans = main()
print(ans) | import sys
s = sys.stdin.readline().rstrip()
def main():
prev = '$'
cnt = -1
for c in s:
cnt += c != prev
prev = c
print(cnt)
if __name__ == '__main__':
main() | p03945 |
def line(s):
ret = [0] * len(s)
for i in range(len(s)):
ret[i] = 0 if s[i] == 'W' else 1
return ret
def all_same(arr):
for i in range(len(arr)-1):
if arr[i] != arr[i+1]:
return False
return True
def opposite(x):
return (x - 1) ** 2
def update(arr):
count = 0
while(not all_same(arr)):
append = opposite(arr[-1])
other = arr[-1]
i = -1
while(arr[i] == other or -i == len(arr) + 1):
arr[i] = append
i -= 1
if -i == len(arr)/2:
arr.reverse()
count += 1
return count
if __name__ == '__main__':
s = input()
arr = line(s)
print((update(arr)))
| def line(s):
ret = [0] * len(s)
for i in range(len(s)):
ret[i] = 0 if s[i] == 'W' else 1
return ret
def count(arr):
c = 0
for i in range(len(arr)-1):
if arr[i+1] != arr[i]:
c += 1
return c
if __name__ == '__main__':
s = input()
arr = line(s)
print((count(arr)))
| p03945 |
def isSame(string):
for i in range(1, len(string)):
if string[i] != string[0]:
return False
return True
s = input()
a = []
l = len(s)
for i in range(l):
a.append(s[i])
n = 0
while not isSame(a):
if a[0] == 'B':
for i in range(l):
if a[i] == 'B':
a[i] = 'W'
else:
break
a.insert(0, 'W')
elif a[0] == 'W':
for i in range(l):
if a[i] == 'W':
a[i] = 'B'
else:
break
a.insert(0, 'B')
n += 1
l += 1
print(n)
| s = input()
temp = s[0]
n = 0
for i in range(len(s)):
if s[i] != temp:
n += 1
temp = s[i]
print(n) | p03945 |
import sys
input = sys.stdin.readline
S = list(input().rstrip())
N = len(S)
cnt = 0
for i in range(N-1):
if S[i] != S[i+1]:
cnt += 1
print(cnt)
| import sys
input = sys.stdin.readline
s = input().rstrip()
cnt = 0
for i in range(len(s) - 1):
if s[i] != s[i + 1]:
cnt += 1
print(cnt)
| p03945 |
import sys
import os
import math
import bisect
import collections
import itertools
import heapq
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: x * y / math.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = itertools.groupby(list(iss()))
q = ''
ret = 0
for s in S:
if q == '':
q = s
if q != s:
ret += 1
q = s
print(ret)
if __name__ == '__main__':
main()
| import sys
import os
import math
import bisect
import collections
import itertools
import heapq
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: x * y / math.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = list(iss())
q = S[0]
ret = 0
for s in S:
if q != s:
ret += 1
q = s
print(ret)
if __name__ == '__main__':
main()
| p03945 |
S = input().strip()
cnt = 0
cur = S[0]
cnt += 1
for i in range(1,len(S)):
if S[i]==cur:continue
else:
cnt += 1
cur = S[i]
print((cnt-1)) | S = input().strip()
cur = S[0]
cnt = 0
for i in range(1,len(S)):
if S[i]==cur:continue
else:
cnt += 1
cur = S[i]
print(cnt) | p03945 |
S = input().strip()
N = len(S)
cur = 0
cnt = 0
for i in range(1,N):
if S[i]!=S[cur]:
cnt += 1
cur = i
print(cnt) | S = input().strip()
cnt = 0
for i in range(1,len(S)):
if S[i]!=S[i-1]:
cnt += 1
print(cnt) | p03945 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
def merge(s1, s2):
ls1 = len(s1)
ls2 = len(s2)
i1 = 0
i2 = 0
ans = []
while (i1 < ls1 and i2 < ls2):
if s1[i1] < s2[i2]:
ans.append(s1[i1])
i1 += 1
else:
ans.append(s2[i2])
i2 += 1
for i in range(i1, ls1):
ans.append(s1[i])
for i in range(i2, ls2):
ans.append(s2[i])
return ans
import bisect
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
bisect.insort_left(ABs[A], B)
As = 0
for i in range(M + 1):
if i > 0:
ABs[0] = merge(ABs[0], ABs[i])
if len(ABs[0]) > 0:
As += ABs[0].pop()
print(As) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import bisect
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(B)
ABs[0].sort()
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
bisect.insort_left(ABs[0], b)
if len(ABs[0]) > 0:
As += ABs[0].pop(-1)
print(As) | p02948 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import bisect
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(B)
ABs[0].sort()
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
bisect.insort_left(ABs[0], b)
if len(ABs[0]) > 0:
As += ABs[0].pop(-1)
print(As) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import bisect
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(B)
ABs[0].sort()
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
bisect.insort_left(ABs[0], b)
if len(ABs[0]) > 0:
As += ABs[0].pop()
print(As) | p02948 |
def resolve():
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import bisect
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(B)
ABs[0].sort()
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
bisect.insort_left(ABs[0], b)
if len(ABs[0]) > 0:
As += ABs[0].pop()
print(As)
if __name__ == '__main__':
resolve() | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import heapq
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(-B)
heapq.heapify(ABs[0])
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
heapq.heappush(ABs[0], b)
if len(ABs[0]) > 0:
As += heapq.heappop(ABs[0])
print((-As)) | p02948 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import heapq
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(-B)
heapq.heapify(ABs[0])
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
heapq.heappush(ABs[0], b)
if len(ABs[0]) > 0:
As += heapq.heappop(ABs[0])
print((-As)) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
import heapq
ABs = [[] for _ in range(M + 1)]
for i in range(N):
A, B = list(map(int, input().split()))
if A <= M:
ABs[A].append(-B)
heapq.heapify(ABs[0])
As = 0
for i in range(M + 1):
if i > 0:
for b in ABs[i]:
heapq.heappush(ABs[0], b)
if len(ABs[0]) > 0:
As -= heapq.heappop(ABs[0])
print(As) | p02948 |
from heapq import *
R = lambda: list(map(int, input().split()))
n, m = R()
c = [[] for _ in range(m)]
for _ in range(n):
a, b = R()
if a <= m:
heappush(c[m - a], -b)
r=0
for i in range(m - 1, -1, -1):
if c[i]:
r -= heappop(c[i])
if i:
for x in c[i]:
heappush(c[i - 1], x)
print(r)
| from heapq import *
R = lambda: list(map(int, input().split()))
n, m = R()
c = [[] for _ in range(m)]
for _ in range(n):
a, b = R()
if a <= m:
heappush(c[m - a], -b)
r=0
for i in range(m - 1, -1, -1):
if c[i]:
r -= heappop(c[i])
if i:
f = len(c[i]) > len(c[i - 1])
h, g = (c[i], c[i - 1]) if f else (c[i - 1], c[i])
for x in g:
heappush(h, x)
if f:
c[i - 1] = c[i]
print(r)
| p02948 |
from heapq import *
R = lambda: list(map(int, input().split()))
n, m = R()
c = [[] for _ in range(m)]
for _ in range(n):
a, b = R()
if a <= m:
heappush(c[m - a], -b)
r=0
for i in range(m - 1, -1, -1):
if c[i]:
r -= heappop(c[i])
if i:
f = len(c[i]) > len(c[i - 1])
h, g = (c[i], c[i - 1]) if f else (c[i - 1], c[i])
for x in g:
heappush(h, x)
if f:
c[i - 1] = c[i]
print(r)
| from heapq import heappush, heappop
R = lambda: list(map(int, input().split()))
n, m = R()
c = [[] for _ in range(m)]
for _ in range(n):
a, b = R()
if a <= m:
c[m - a].append(b)
r=0
h = []
for l in reversed(c):
for x in l:
heappush(h, -x)
if h:
r -= heappop(h)
print(r)
| p02948 |
from heapq import heappush, heappop
from copy import deepcopy
def main():
n, m = list(map(int,input().split()))
h = []
for i in range(n):
day, value = list(map(int,input().split()))
heappush(h, (-1*value, day))
res = 0
done = []
for i in range(1, m+1):
cur_h = deepcopy(h)
while cur_h:
r = heappop(cur_h)
if r[1] <= i and not r in done:
res += r[0]*-1
done.append(r)
break
print(res)
if __name__ == "__main__":
main()
| from heapq import heappush, heappop
def main():
n, m = list(map(int,input().split()))
jobs = []
for i in range(n):
day, value = list(map(int,input().split()))
jobs.append((day, value))
jobs.sort()
cur, res = 0, 0
done = []
h = []
for i in range(1, m+1):
while cur < n and jobs[cur][0] <= i:
heappush(h, -jobs[cur][1])
cur += 1
if not h:
continue
res -= heappop(h)
print(res)
if __name__ == "__main__":
main() | p02948 |
n,m=list(map(int,input().split()))
A=[]
for i in range(n):
a,b=list(map(int,input().split()))
A.append([a,b])
A=sorted(A, key=lambda x:(x[0], -x[1]))
from collections import deque
A=deque(A)
# import numpy as np
ans=0
now=[]
for nouki in range(1,m+1):
while A:
a,b=A.popleft()
if a>nouki: A.appendleft([a,b]);break
now.append(b)
#print(nouki, now)
if now==[]:continue
m=max(now)
ans+= m
now.remove(m)
print(ans)
| n,m=list(map(int,input().split()))
A=[]
for i in range(n):
a,b=list(map(int,input().split()))
A.append([a,b])
A=sorted(A, key=lambda x:(x[0], -x[1]))
from collections import deque
A=deque(A)
# import numpy as np
import bisect as bi
ans=0
now=[]
for nouki in range(1,m+1):
while A:
a,b=A.popleft()
if a>nouki: A.appendleft([a,b]);break
bi.insort(now,b)
#print(nouki, now)
if now==[]:continue
ans+= now[-1]
del now[-1]
print(ans)
| p02948 |
import bisect
n,m = (int(num) for num in input().split())
ab = [[0,0] for _ in range(n)]
for i in range(n):
a,b = (int(num) for num in input().split())
ab[i][0] = a
ab[i][1] = b
#print(ab)
ab.sort(key = lambda x: x[1], reverse=True)
days = [i+1 for i in range(m)]
leng = m
ans = 0
for item in ab:
a = item[0]
b = item[1]
idx = bisect.bisect_left(days,a)
if idx < leng:
days.pop(idx)
leng -= 1
ans += b
print(ans)
| import bisect
n,m = (int(num) for num in input().split())
ab = [[0,0] for _ in range(n)]
for i in range(n):
a,b = (int(num) for num in input().split())
ab[i][0] = a
ab[i][1] = b
#print(ab)
ab.sort(key = lambda x: x[1], reverse=True)
days = [i+1 for i in range(m)]
leng = m
ans = 0
for item in ab:
if leng <= 0:
break;
a = item[0]
b = item[1]
idx = bisect.bisect_left(days,a)
if idx < leng:
days.pop(idx)
leng -= 1
ans += b
print(ans)
| p02948 |
def main():
from collections import defaultdict
from heapq import heappush, heappop
_, m, *ab = list(map(int, open(0).read().split()))
works = defaultdict(list)
# == zip(ab[0::2], ab[1::2])
for a, b in zip(*[iter(ab)]*2):
# 最大値が欲しいが、heappopは最小値を取り出すので-1倍しておく
works[a].append(-b)
candidates, pay = [], 0
for day in range(1, m+1):
for x in works[day]:
heappush(candidates, x)
if candidates:
pay -= heappop(candidates)
print(pay)
if __name__ == "__main__":
main()
| def main():
from collections import defaultdict
from heapq import heappush, heappop
_, m, *ab = list(map(int, open(0).read().split()))
works = defaultdict(list)
# == zip(ab[0::2], ab[1::2])
for a, b in zip(*[iter(ab)]*2):
# 最大値が欲しいが、heappopは最小値を取り出すので-1倍しておく
works[a].append(-b)
# candidates, pay = [], []
# for day in range(1, m+1):
# for x in works[day]:
# heappush(candidates, x)
# if candidates:
# pay.append(heappop(candidates))
# print(-sum(pay))
# こっちの方が遅い
candidates, pay = [], 0
for day in range(1, m+1):
for x in works[day]:
heappush(candidates, x)
if candidates:
pay += heappop(candidates)
print((-pay))
if __name__ == "__main__":
main()
| p02948 |
def main():
from collections import defaultdict
from heapq import heappush, heappop
_, m, *ab = list(map(int, open(0).read().split()))
works = defaultdict(list)
for a, b in zip(ab[0::2], ab[1::2]):
works[a].append(-b)
candidates, pay = [], 0
for day in range(1, m+1):
for x in works[day]:
heappush(candidates, x)
if candidates:
pay += heappop(candidates)
print((-pay))
if __name__ == "__main__":
main()
| def main():
from collections import defaultdict
from heapq import heappush, heappop
_, m, *ab = list(map(int, open(0).read().split()))
works = defaultdict(list)
for a, b in zip(*[iter(ab)]*2):
works[a].append(-b)
candidates, pay = [], 0
for day in range(1, m+1):
if day in works:
for x in works[day]:
heappush(candidates, x)
if candidates:
pay += heappop(candidates)
print((-pay))
if __name__ == "__main__":
main()
| p02948 |
import heapq
N, M = list(map(int, input().split()))
value = [[] for _ in range(10 ** 5 + 1)]
for _ in range(N):
a, b = list(map(int, input().split()))
value[a].append(-1 * b)
for v in value:
heapq.heapify(v)
ans = 0
for i in range(1, M + 1):
my_max = 0
for j, k in enumerate(list(range(i)), 1):
if len(value[j]) > 0:
tmp = -1 * heapq.heappop(value[j])
if my_max < tmp:
my_max = tmp
else:
heapq.heappush(value[j], tmp * -1)
ans += my_max
print(ans)
| import heapq
N, M = list(map(int, input().split()))
value = [[] for _ in range(10 ** 5 + 1)]
for _ in range(N):
a, b = list(map(int, input().split()))
value[a].append(-1 * b)
koho = value[1]
heapq.heapify(koho)
ans = 0
for i in range(1, M + 1):
if len(koho) > 0:
ans += -1 * heapq.heappop(koho)
if i < M:
for v in value[i + 1]:
heapq.heappush(koho, v)
print(ans)
| p02948 |
N, M = list(map(int, input().strip().split()))
A = {}
for i in range(N):
a, b = list(map(int, input().strip().split()))
if a not in A: A[a] = []
A[a].append(b)
total = 0
days = []
for i in range(1, M + 1):
if i in A:
days.extend(A[i])
days = sorted(days)
if len(days) > 0:
a = len(days)
total += days.pop()
print(total)
| import heapq
N, M = list(map(int, input().strip().split()))
A = {}
for i in range(N):
a, b = list(map(int, input().strip().split()))
if a not in A: A[a] = []
A[a].append(b)
total = 0
days = []
for i in range(1, M + 1):
if i in A:
for a in A[i]:
heapq.heappush(days, -a)
if len(days) > 0:
total += - heapq.heappop(days)
print(total)
| p02948 |
from heapq import heappush, heappop
from collections import defaultdict
N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
cand = defaultdict(list)
for a, b in X:
cand[a].append(b)
pq = []
ans = 0
for i in range(1, M + 1):
for c in cand[i]:
heappush(pq, -c)
if pq:
ans -= heappop(pq)
print(ans)
| from heapq import heappush, heappop
N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
pq = []
for a, b in X:
heappush(pq, (a, b))
cand = []
ans = 0
for t in range(1, M + 1):
while pq:
a, b = heappop(pq)
if a <= t:
heappush(cand, -b)
else:
heappush(pq, (a, b))
break
if cand:
v = heappop(cand)
ans += -v
print(ans)
| p02948 |
N, M = list(map(int, input().split()))
work = [0] * N
for i in range(N):
work[i] = [0] * 2
work[i][1], work[i][0] = list(map(int, input().split()))
ans = 0
work_money = sorted(work)
schedule = [0]*M
for j in range(N):
day = M - work_money[N - 1 - j][1]
day_index = day
while day_index >= 0:
if schedule[day_index] == -1:
break
if schedule[day_index] == 0:
if day_index > 0:
if schedule[day_index - 1] == -1:
schedule[day_index] = -1
ans += work_money[N - 1 - j][0]
break
schedule[day_index] = 1
ans += work_money[N - 1 - j][0]
break
day_index -= 1
if day_index == -1:
schedule[day] = -1
print(ans)
| import heapq
N, M = list(map(int, input().split()))
work = [0] * N
for i in range(N):
work[i] = [0] * 2
a, b = list(map(int, input().split()))
if M-a >= 0:
work[i][0], work[i][1] = a, -1 * b
else:
work[i][0], work[i][1] = 10**9, -1 * b
ans = 0
work_day = sorted(work)
index = 0
heap = []
heapq.heapify(heap)
for j in range(M+1):
if index >= N:
if len(heap) > 0:
ans += heapq.heappop(heap)*(-1)
continue
while (work_day[index][0] <= j):
heapq.heappush(heap, work_day[index][1])
index += 1
if index >= N:
break
if len(heap) > 0:
ans += heapq.heappop(heap)*(-1)
print(ans)
| p02948 |
import heapq
n,m = list(map(int,input().split()))
Jobs = [list(map(int,input().split()))for i in range(n)]
Days = [[] for i in range(m)]
for i in range(n):
if Jobs[i][0] <= m:
Days[Jobs[i][0]-1] += [[-Jobs[i][1],Jobs[i][0]]]
Heap = []
heapq.heapify(Heap)
ans = 0
for i in range(m):
for job in Days[i]:
heapq.heappush(Heap,job)
if Heap:
ans -= heapq.heappop(Heap)[0]
print(ans) | from heapq import heappop,heappush
N,M = list(map(int,input().split()))
job = [tuple(map(int,input().split())) for _ in range(N)]
job.sort(key=lambda x:x[1],reverse=True)
job.sort(key=lambda x:x[0])
heap = []
ans = 0
j = -1
for i in range(M)[::-1]:
while j < N-1 and job[j+1][0]+i <= M:
j += 1
heappush(heap,-job[j][1])
if heap:
ans += -heappop(heap)
print(ans) | p02948 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.