Ruby code only. Correct and detailed answer will upvoted else downvoted. Output screenshot required. You are given n sections on the Ox-hub. You can drive a nail in any integer point on the Ox-hub line nail thus, that all portions containing this point, are considered made certain about. In the event that the nail goes through endpoint of some fragment, this section is viewed as nailed as well. What is the most modest number of nails
In Ruby code only. Correct and detailed answer will upvoted else downvoted. Output screenshot required.
You are given n sections on the Ox-hub. You can drive a nail in any integer point on the Ox-hub line nail thus, that all portions containing this point, are considered made certain about. In the event that the nail goes through endpoint of some fragment, this section is viewed as nailed as well. What is the most modest number of nails expected to nail every one of the portions down?
Input :The primary line of the input contains single integer number n (1 ≤ n ≤ 1000) — measure of sections. Following n lines contain portrayals of the fragments. Every portrayal is a couple of integer numbers — endpoints organizes. Every one of the directions don't surpass 10000 by outright worth. Fragments can degenarate to focuses.
Output : The primary line ought to contain one integer number — the most modest number of nails expected to nail every one of the sections down. The subsequent line ought to contain directions of driven nails isolated by space in any request. On the off chance that the appropriate response isn't one of a kind
Step by step
Solved in 4 steps with 1 images
