結果
問題 |
No.649 ここでちょっとQK!
|
ユーザー |
|
提出日時 | 2019-03-17 18:38:19 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 240 ms / 3,000 ms |
コード長 | 3,299 bytes |
コンパイル時間 | 1,578 ms |
コンパイル使用メモリ | 174,300 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-07 13:32:03 |
合計ジャッジ時間 | 5,683 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 32 |
ソースコード
#include "bits/stdc++.h" using namespace std; /* macro */ #define rep(i,a,b) for(int i=a;i<b;i++) #define revrep(i,a,b) for(int i = a; i > b; i--) #define int long long #define exist(s,e) ((s).find(e)!=(s).end()) #define all(v) (v).begin(), (v).end() #define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++) #define sum(v) accumulate(all(v), (0LL)) #define isin(a, b, c) (b <= a && a <= c) #define println cout << "\n"; #define sz(v) (int)v.size() #define bin(x) static_cast<bitset<16> >(x) /* alias */ template<class T> using vec = vector<T>; typedef vector<int> vi; typedef pair<int, int> pi; typedef tuple<int, int, int> ti; typedef map<int, int> mi; typedef set<int> si; /* constant */ const int inf = 1LL << 62; const int mod = 1e9 + 7; const int dx[8]={1,0,-1,0,-1,1,-1,1}; const int dy[8]={0,1,0,-1,-1,-1,1,1}; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; /* io_method */ int input(){int tmp;cin >> tmp;return tmp;} string raw_input(){string tmp;cin >> tmp;return tmp;} template<class T> void printx(T n){cout << n;} template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";} template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;} template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";} template<class T> void print(T n){printx(n);cout << endl;} template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;} template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;} template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;} /* general_method */ template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);} /* main */ int q, k; void in(){ cin >> q >> k; } void solve(){ priority_queue<int> max_heap; priority_queue<int, vi, greater<int>> min_heap; rep(i,0,q){ int query = input(); if(query == 1){ int v = input(); if(sz(max_heap) < k){ max_heap.push(v); }else{ if(max_heap.top() > v){ int tmp = max_heap.top(); max_heap.pop(); max_heap.push(v); min_heap.push(tmp); }else{ min_heap.push(v); } } }else{ if(sz(max_heap) == k){ cout << max_heap.top() << endl; max_heap.pop(); if(not min_heap.empty()){ max_heap.push(min_heap.top()); min_heap.pop(); } }else{ print(-1); } } } } signed main(){ cin.tie(0); ios::sync_with_stdio(false); in(); solve(); }