2015 Multi-University Training Contest 5 - MZL's simple problem

MZL's simple problem

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

Problem Description

  
  

   
   A simple problem
Problem Description
You have a multiple set,and now there are three kinds of operations:
1 x : add number x to set
2 : delete the minimum number (if the set is empty now,then ignore it)
3 : query the maximum number (if the set is empty now,the answer is 0)
  
  

 

Input

  
  

   
   The first line contains a number 
   
   
   
   
    
    
     
     N
    
     (
   
   
   
   
    
    
     
     N≤106
    
    ),representing the number of operations.
Next 
   
   
   
   
    
    
     
     N
    
     line ,each line contains one or two numbers,describe one operation.
The number in this set is not greater than 
   
   
   
   
    
    
     
     109
    
    .
  
  

 

Output

  
  

   
   For each operation 3,output a line representing the answer.
  
  

 

Sample Input

  
  

   
   6
1 2
1 3
3
1 3
1 4
3
  
  

 

Sample Output

  
  

   
   3
4
  
  

 

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;

int main()
{
    set<int>st;
    st.clear();
    int n,i,j,k,x,y;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&x);
        if(x==1){
            scanf("%d",&y);
            st.insert(y);
        }
    
        
    
        else if(x==2){
            if(!st.empty())
                st.erase(st.begin());
        }
        else if(x==3){
            if(st.empty())
			    printf("0\n");
            else {
                printf("%d\n",*--st.end());
            }
        }
    }
    
    return 0;
}