Problem
Given K sorted lists of N integers each, find the smallest range [L, R] such that each of the K lists contains at least one number in this range.
Input format
Input
input.txt
- The first line contains K and N (1 ≤ K,N ≤ 5). - Each of the next K lines contains N integers in increasing order.
Output format
Output
output.txt
- Two integers L and R, the smallest range.
Example
input
3 4 4 10 15 24 0 9 12 20 5 18 22 30
output
20 24
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
3 4 4 10 15 24 0 9 12 20 5 18 22 30
Expected output
20 24
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc