1 #Suppose you have a random list of people standing in a queue. 2 # Each person is described by a pair of integers (h, k), 3 #where h is the height of the person and k is the number of people. 4 # in front of this person who have a height greater than or equal to h. #Write an algorithm to reconstruct the queue. 5 6 7 8 9 # Note: # The number of people is less than 1,100. 10 11 12 # Input: 13 14 15 # Output: 16 # [[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]] 17 18 def reconstruct_queue (people): 19 20 21 22 23 24 25 26 27 # Example # [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] www. :type people: List[List[int]] :rtype: List[List[int]] queue [] people.sort(key-lambda x: (-x[0], x[1])) for h, k in people: queue.insert(k, [h, k]) return queue
1 #Suppose you have a random list of people standing in a queue. 2 # Each person is described by a pair of integers (h, k), 3 #where h is the height of the person and k is the number of people. 4 # in front of this person who have a height greater than or equal to h. #Write an algorithm to reconstruct the queue. 5 6 7 8 9 # Note: # The number of people is less than 1,100. 10 11 12 # Input: 13 14 15 # Output: 16 # [[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]] 17 18 def reconstruct_queue (people): 19 20 21 22 23 24 25 26 27 # Example # [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] www. :type people: List[List[int]] :rtype: List[List[int]] queue [] people.sort(key-lambda x: (-x[0], x[1])) for h, k in people: queue.insert(k, [h, k]) return queue
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
Related questions
Question
Asap do this? .
![1 #Suppose you have a random list of people standing in a queue.
# Each person is described by a pair of integers (h, k),
#where h is the height of the person and k is the number of people
# in front of this person who have a height greater than or equal to h.
# Write an algorithm to reconstruct the queue.
2
3
4
5
6
7
8
9
# Note:
# The number of people is less than 1,100.
# Example
10
11
12 #Input:
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
# [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
# Output:
# [[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
def reconstruct_queue (people):
type people: List[List[int]]
:rtype: List[List[int]]
www
queue = []
people.sort(key=lambda x: (-x[0], x[1]))
for h, k in people:
queue.insert(k, [h, k])
return queue](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3437af43-6a1b-4faa-a426-da58e71127ca%2Ff58f29b4-3504-431b-a212-c0efa136c75e%2Fvi9fwlp_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1 #Suppose you have a random list of people standing in a queue.
# Each person is described by a pair of integers (h, k),
#where h is the height of the person and k is the number of people
# in front of this person who have a height greater than or equal to h.
# Write an algorithm to reconstruct the queue.
2
3
4
5
6
7
8
9
# Note:
# The number of people is less than 1,100.
# Example
10
11
12 #Input:
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
# [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
# Output:
# [[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
def reconstruct_queue (people):
type people: List[List[int]]
:rtype: List[List[int]]
www
queue = []
people.sort(key=lambda x: (-x[0], x[1]))
for h, k in people:
queue.insert(k, [h, k])
return queue
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images

Knowledge Booster
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.Recommended textbooks for you

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education