You learned about priority queues recently and are now ready to solve problems using them! So here's one. Suppose you have an integer array A. For each index i, you want to find the product of the largest, second largest and the third largest integer in the range [1,i). Note: Two numbers can be the same value-wise but they should be distinct index-wise. Input: The first line contains an integer N, denoting the number of elements in the array A. The next line contains N space separated integers, each denoting the ith integer of the array A. Output: Print the answer for each index in each line. If there is no second largest or third largest number in the array A upto that index, then print "-1", without the quotes. Constraints: 1 <= N <= 100000 0 <= A[i) <= 1000000 Sample Input 12345

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 write a C code:

You learned about priority queues recently and are now ready to solve problems using
them! So here's one. Suppose you have an integer array A. For each index i, you want to find
the product of the largest, second largest and the third largest integer in the range [1,i).
Note: Two numbers can be the same value-wise but they should be distinct index-wise.
Input:
The first line contains an integer N, denoting the number of elements in the array A.
The next line contains N space separated integers, each denoting the ith integer of the
array A.
Output:
Print the answer for each index in each line. If there is no second largest or third largest
number in the array A upto that index, then print "-1", without the quotes.
Constraints:
1 <= N <= 100000
0 <= A[i) <= 1000000
Sample Input
12345
Transcribed Image Text:You learned about priority queues recently and are now ready to solve problems using them! So here's one. Suppose you have an integer array A. For each index i, you want to find the product of the largest, second largest and the third largest integer in the range [1,i). Note: Two numbers can be the same value-wise but they should be distinct index-wise. Input: The first line contains an integer N, denoting the number of elements in the array A. The next line contains N space separated integers, each denoting the ith integer of the array A. Output: Print the answer for each index in each line. If there is no second largest or third largest number in the array A upto that index, then print "-1", without the quotes. Constraints: 1 <= N <= 100000 0 <= A[i) <= 1000000 Sample Input 12345
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Concept of Parenthesis
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
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