zoukankan      html  css  js  c++  java
  • [STL] [洛谷] P1165 日志分析

    STL操作

    //#pragma GCC optimize(2)
    #include <cstdio>
    #include <iostream>
    #include <cstdlib>
    #include <cmath>
    #include <cctype>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <stack>
    #include <queue>
    #include <set>
    #include <map>
    #include <ctime>
    #include <vector>
    #include <fstream>
    #include <list>
    #include <iomanip>
    #include <numeric>
    using namespace std;
    typedef long long ll;
    
    const int MAXN = 1e6 + 10;
    
    stack <int> ST;
    
    multiset <int> MS;
    
    int main()
    {
        //ios::sync_with_stdio(false);
    
        //cin.tie(0);     cout.tie(0);
    
        int n, x, y;
    
        cin>>n;
    
        while(n--)
        {
            cin>>x;
            if(x == 0)
            {
                cin>>y;
                ST.push(y);
                MS.insert(-y);
            }
            else if(x == 1)
            {
                int y = ST.top();
    
                ST.pop();
    
                MS.erase(MS.find(-y));
            }
            else if(x == 2)
            {
                y = *MS.begin();
    
                cout<<-y<<endl;
            }
        }
    
    
    
        return 0;
    }
  • 相关阅读:
    0722
    SGU
    预测一下吧
    0625
    0624
    0610
    0607
    0604
    poj2455Secret Milking Machine【二分 + 最大流】
    BZOJ3489: A simple rmq problem
  • 原文地址:https://www.cnblogs.com/zeolim/p/12270435.html
Copyright © 2011-2022 走看看