Submission #1265482

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265482		tgirolami09	Bouquet (EGOI24_bouquet)	Pypy 3	24 / 100	289 ms	77576 KiB

Main

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)

Compilation message (stdout)

Compiling 'Main.py'...

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

=======

• Subtask 1: 8 / 8
• Subtask 2: 16 / 16
• Subtask 3: 0 / 28
• Subtask 4: 0 / 18
• Subtask 5: 0 / 30