IRCTC K Pairs Smallest Route Costs
IRCTC K Pairs Smallest Route Costs
HardHeaps0% accepted
IRCTC has two sorted fare arrays. Find k pairs (one from each array) with the smallest pairwise sums.
Approach
Find k pairs with smallest sums from two sorted arrays using a min-heap.
Input
3 3 3
1 7 11
2 4 6
Output
[[1,2],[1,4],[1,6]]
More Heaps problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards