**QHEAP1**

### Problem Statement :

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct elements will be in the heap. Input Format The first line contains the number of queries, Q. Each of the next Q lines contains a single query of any one of the 3 above mentioned types. Output Format For each query of type 3, print the minimum value on a single line.

### Solution :

` ````
Solution in C :
In C ++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#include <queue>
int main() {
vector<int> vec;
int q;
cin >> q;
int minval=1000000007;
bool flag=false;
for (int i=0; i<q; i++)
{
int a,v;
cin >> a;
if (a==1)
{
cin >> v;
vec.push_back(v);
minval=min(minval,v);
}
if (a==2)
{
cin >> v;
if (v==minval)
flag=true;
for (int j=0; j<vec.size(); j++)
{
if (vec[j]==v)
{
vec.erase(vec.begin()+j);
}
}
}
if (a==3)
{
if (flag)
{
minval=1000000007;
for (int j=0; j<vec.size();j++)
{
minval=min(minval,vec[j]);
}
flag = false;
}
cout << minval << endl;
}
}
/*
priority_queue<int> pq;
int q;
cin >> q;
for (int i=0; i<q; i++)
{
int a,v;
cin >> a;
if (a==1)
{
cin >> v;
pq.push(-1*v);
}
if (a==2)
{
cin >> v;
pq.pop();
}
if (a==3)
{
cout << pq.top()*-1 << endl;
//pq.pop();
}
}
*/
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
for (int i=0;i<n;i++) {
int cmd = s.nextInt();
switch (cmd) {
case 1:
int val = s.nextInt();
pq.add(val);
break;
case 2:
val = s.nextInt();
pq.remove(val);
break;
case 3:
val = pq.peek();
System.out.println(val);
break;
}
}
s.close();
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int arr[1000000];
int curr=-1;
int mindex(int left,int right){
return arr[left]<arr[right]?left:right;
}
int find_index(int y){
for(int i=0;i<=curr;i++)
if(arr[i]==y)
return i;
return -1;
}
void heapifyUp(int index){
int parent=index/2;
if(arr[parent]<arr[index] || (parent==index))
return;
else{
int temp=arr[parent];
arr[parent]=arr[index];
arr[index]=temp;
heapifyUp(parent);
}
return;
}
void heapifyDown(int index){
int left=2*index;
int right=2*index+1;
if(left<=curr && right<=curr){
if(arr[index]<arr[left] && arr[index]<arr[right])
return;
else{
int min_index=mindex(left,right);
int temp=arr[min_index];
arr[min_index]=arr[index];
arr[index]=temp;
heapifyDown(min_index);
}
}
}
void insert(int y){
arr[++curr]=y;
heapifyUp(curr);
/*for(int i=0;i<=curr;i++)
printf("%d\t",arr[i]);
printf("\n");*/
}
void delet(int y){
int index=find_index(y);
//printf("found index:%d\t",index);
if(index!=-1){
arr[index]=arr[curr--];
heapifyDown(index);
}
/*for(int i=0;i<=curr;i++)
printf("%d\t",arr[i]);
printf("\n");
*/
}
int main() {
int n,x,y;
scanf("%d",&n);
while(n--){
scanf("%d",&x);
if(x==1){
scanf("%d",&y);
insert(y);
}
if(x==2){
scanf("%d",&y);
delet(y);
}
if(x==3){
if(curr>=0)
printf("%d\n",arr[0]);
}
}
return 0;
}
In Python3 :
import heapq
m = []
N = int(input())
di = dict()
for i in range(N):
b = input().split()
if b[0] == '1':
b = int(b[1])
di[b] = 0
heapq.heappush(m,b)
elif b[0] == '2':
b = int(b[1])
di[b] = 1
else:
while di[m[0]] == 1:
heapq.heappop(m)
print(m[0])
```

## View More Similar Problems

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →## Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →## Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →