Input The input consists of a single integer N (1 ≤N ≤ 10^5), the number of tasks, followed by N lines representing the tasks. Each task is represented by two integers S₁ and E₁ (0 ≤ S; ≤E; S 10^9), the start and end times of the task, respectively. Output Output a single integer k, the maximum number of tasks you can complete, followed by a line with k intervals of the tasks you can complete. If there are multiple solutions with the same maximum number of tasks, print any one of them. Sample Input/Output: Sample Input 1 6 25 37 46 68 79 Sample Output 1 3 1 3 46 68 You are a busy person with lots of tasks to do. You have a schedule of tasks represented by intervals of time, where each interval represents a task that you need to complete. However, you can only work on one task at a time, and you want to complete as many tasks as possible. Given a list of N intervals of time, your task is to determine the maximum number of tasks you can complete and which tasks they are.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please use python and python file i/o to solve the problem. Create an input file input1_1.txt as shown below, solve the problem and print the output to output1_1.txt file as shown in the question.

Input
The input consists of a single integer N (1 ≤N ≤ 10^5), the
number of tasks, followed by N lines representing the tasks.
Each task is represented by two integers S₁ and E₁ (0 ≤ S; ≤E; S
10^9), the start and end times of the task, respectively.
Output
Output a single integer k, the maximum number of tasks you can
complete, followed by a line with k intervals of the tasks you
can complete.
If there are multiple solutions with the same maximum number of
tasks, print any one of them.
Sample Input/Output:
Sample Input 1
6
25
37
46
68
79
Sample Output 1
3
1 3
46
68
Transcribed Image Text:Input The input consists of a single integer N (1 ≤N ≤ 10^5), the number of tasks, followed by N lines representing the tasks. Each task is represented by two integers S₁ and E₁ (0 ≤ S; ≤E; S 10^9), the start and end times of the task, respectively. Output Output a single integer k, the maximum number of tasks you can complete, followed by a line with k intervals of the tasks you can complete. If there are multiple solutions with the same maximum number of tasks, print any one of them. Sample Input/Output: Sample Input 1 6 25 37 46 68 79 Sample Output 1 3 1 3 46 68
You are a busy person with lots of tasks to do. You have a
schedule of tasks represented by intervals of time, where each
interval represents a task that you need to complete. However,
you can only work on one task at a time, and you want to
complete as many tasks as possible.
Given a list of N intervals of time,
your task is to determine
the maximum number of tasks you can complete and which tasks
they are.
Transcribed Image Text:You are a busy person with lots of tasks to do. You have a schedule of tasks represented by intervals of time, where each interval represents a task that you need to complete. However, you can only work on one task at a time, and you want to complete as many tasks as possible. Given a list of N intervals of time, your task is to determine the maximum number of tasks you can complete and which tasks they are.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Random Class and its operations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education