Answered: Please don’t use chegg C++ programming…

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

See similar textbooks

Related questions

Question

Please don’t use chegg C++ programming You are playing a mobile game with circular balls. At the beginning, you are given an string representing an array of integers where every element represents radius of the circle. At every stage, you need to pick the two largest circles and merge them together according to following set of rules: 1)If r1 == r2, both circles are vanished 2) If r1 != r2, find abs(r1 - r2) as new radius and replace it higher radius circle and then remove the other circle. At the end of the game, there will be at most one circle left. If there are no circle left, return 0. Otherwise return the radius of the last circle. You MUST use a Priority Queue implementation to receive credit. You may NOT use STL to implement the Priority Queue directly, however you are allowed to use vectors and such. Case 1:Input 1: 3 3 Output 1: 0 Case 2:Input 2: 1 2 3 1 Output 2: 1 Case 3:Input 3: 30 80 50 10 90 20 50Output 3: 10

Expert Solution