# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1265482 | tgirolami09 | Bouquet (EGOI24_bouquet) | Pypy 3 | 289 ms | 77576 KiB |
n = int(input())
lst = []
for i in range(n):
a,b = map(int,input().split())
# lst.append((b+i,i-a,i))
lst.append((b+i,i,i-a))
lst.sort()
rightMost = - (10**9)
count = 0
for ele in lst:
# print(f"Looking at interval {ele[2]}-{ele[0]} {ele[1]+1}-th")
if (ele[2] > rightMost):
rightMost = ele[1]
# print(f"Rightmost is now {rightMost}")
count +=1
print(count)
컴파일 시 표준 출력 (stdout) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |