[水题] hdu 5349 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): 717 Accepted Submission(s): 348

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

使用STL中的multiset进行查询题目。
水题一道。

#include <iostream>
#include <cstring>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>

using namespace std;

multiset<int> ms;
int N,a,b;
int main()
{
    multiset<int>::iterator it;
    while(scanf("%d",&N)!= EOF )
    {
        ms.clear();
        while(N--)
        {
            scanf("%d",&a);
            if (a==1)
            {
                scanf("%d",&b);
                ms.insert(b);
            }
            else if (a == 2)
            {
                if (ms.empty()) continue;
                ms.erase(ms.begin());
            }
            else if (a==3)
            {
                if (ms.empty()) {printf("0\n"); continue;}
                it = ms.end();
                it--;
                printf("%d\n",*it);
            }
        }
    }
    return 0;
}