제출 #1265482

#제출 시각아이디문제언어결과실행 시간메모리
1265482tgirolami09Bouquet (EGOI24_bouquet)Pypy 3
24 / 100
289 ms77576 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) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 21%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...