n = int(input())
left = []
right = []
num = [i for i in range(n)] ans = [0] *n
for _ in range(n):
l, r = map(int, input().split())
left.append(l)
right.append(r)
num.sort(key=lambda x: right[x])
for i in range(n):
idx = num[i] while left[idx] <= right[idx]:
ok = True
for j in range(n):
if ans[j] == left[idx]:
ok = False
break
if ok:
break
left[idx] += 1
ans[idx] = left[idx]
print(*ans)
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |