結果

問題 No.649 ここでちょっとQK！
ユーザー ningenMeningenMe
提出日時 2019-11-14 20:22:57
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 285 ms / 3,000 ms
コード長 3,978 bytes
コンパイル時間 1,818 ms
コンパイル使用メモリ 178,808 KB
実行使用メモリ 5,868 KB
最終ジャッジ日時 2023-10-21 21:07:48
合計ジャッジ時間 7,188 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 285 ms
5,404 KB
testcase_04 AC 202 ms
5,868 KB
testcase_05 AC 196 ms
5,808 KB
testcase_06 AC 185 ms
5,668 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 2 ms
4,348 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 107 ms
4,624 KB
testcase_13 AC 106 ms
4,360 KB
testcase_14 AC 103 ms
4,624 KB
testcase_15 AC 109 ms
4,472 KB
testcase_16 AC 96 ms
4,356 KB
testcase_17 AC 113 ms
4,620 KB
testcase_18 AC 124 ms
4,884 KB
testcase_19 AC 137 ms
4,884 KB
testcase_20 AC 148 ms
4,884 KB
testcase_21 AC 159 ms
5,412 KB
testcase_22 AC 170 ms
5,412 KB
testcase_23 AC 180 ms
5,412 KB
testcase_24 AC 188 ms
5,412 KB
testcase_25 AC 203 ms
5,412 KB
testcase_26 AC 215 ms
5,412 KB
testcase_27 AC 2 ms
4,348 KB
testcase_28 AC 2 ms
4,348 KB
testcase_29 AC 3 ms
4,348 KB
testcase_30 AC 74 ms
4,632 KB
testcase_31 AC 65 ms
4,356 KB
testcase_32 AC 2 ms
4,348 KB
testcase_33 AC 2 ms
4,348 KB
testcase_34 AC 2 ms
4,348 KB
testcase_35 AC 2 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int Q,K; cin >> Q >> K;
    priority_queue<ll> pql;
    priority_queue<ll, vector<ll> , greater<ll>> pqr;
    vector<ll> ans;
    while(Q--){
        int q; cin >> q;
        if(q==1){
            ll v; cin >> v;
            if(pql.size()<K) {
                pql.push(v);
            }
            else if(pqr.empty()) {
                ll x = pql.top();
                pql.pop();
                ll l = min(x,v);
                ll r = max(x,v);
                pql.push(l);
                pqr.push(r);
            }
            else {
                ll x = pql.top();
                ll y = pqr.top();
                pql.pop();
                pqr.pop();
                vector<ll> z = {x,y,v};
                sort(ALL(z));
                pql.push(z[0]);
                pqr.push(z[1]);
                pqr.push(z[2]);
            }
        }
        else{
            if(pql.size()<K) {
                ans.push_back(-1);
            }
            else{
                ans.push_back( pql.top() );
                pql.pop();
                if(!pqr.empty()){
                    pql.push(pqr.top());
                    pqr.pop();
                }
            }
        }
    }
    for(auto& e:ans) cout << e << endl;
}
0