結果
問題 | No.649 ここでちょっとQK! |
ユーザー |
![]() |
提出日時 | 2018-03-06 17:19:36 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 154 ms / 3,000 ms |
コード長 | 2,766 bytes |
コンパイル時間 | 1,207 ms |
コンパイル使用メモリ | 123,760 KB |
実行使用メモリ | 12,928 KB |
最終ジャッジ日時 | 2024-09-19 12:17:14 |
合計ジャッジ時間 | 6,165 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 32 |
ソースコード
#define _USE_MATH_DEFINES#include <iostream>#include <fstream>#include <cstdio>#include <cmath>#include <cstdlib>#include <cstring>#include <cassert>#include <string>#include <vector>#include <utility>#include <complex>#include <set>#include <map>#include <queue>#include <stack>#include <deque>#include <tuple>#include <bitset>#include <limits>#include <algorithm>#include <random>#include <complex>#include <regex>using namespace std;typedef long double ld;typedef long long ll;typedef vector<int> vint;typedef pair<int, int> pii;typedef pair<ll, ll> pll;typedef pair<double, double> pdd;typedef complex<ld> compd;#define quickIO() {cin.tie(0); cout.sync_with_stdio(false);}#define reach(i,a) for(auto i:a)#define rep(i,n) for(int i=0;i<(int)n;i++)#define REP(i,n) for(int i=0;i<=(int)n;i++)#define srep(i,a,n) for(int i=a;i<(int)n;i++)#define SREP(i,a,n) for(int i=a;i<=(int)n;i++)#define rrep(i,n) for(int i=n-1;i>=0;i--)#define RREP(i,n) for(int i=n;i>=0;i--)#define all(a) (a).begin(),(a).end()#define mp(a,b) make_pair(a,b)#define mt make_tuple#define pb push_back#define fst first#define scn secondint bitcnt(ll x) {x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);return x;}int bitcnt(int x) {x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);return x;}ll gcd(ll a, ll b) {return a%b == 0 ? b : gcd(b, a%b);}#define debug(x) cout<<"case #" << x << ": " << endl#define DEBUG 0const ll inf = 1e18;const ll mod = 1e9 + 7;const ld eps = 1e-15;const int dx[] = { 1,0,-1,0,0 };const int dy[] = { 0,1,0,-1,0 };int main() {int q, k; scanf("%d %d", &q, &k);multiset<ll> s1;multiset<ll> s2;while (q--) {int query; scanf("%d", &query);if (query == 1) {ll v; scanf("%lld", &v);if (s1.size() < k) s1.insert(v);else if (v < *s1.rbegin()) {ll to2 = *s1.rbegin();s1.erase(s1.lower_bound(to2));s2.insert(to2);s1.insert(v);}else s2.insert(v);}else {if (s1.size() >= k) {ll out = *s1.rbegin();printf("%lld\n", out);s1.erase(s1.lower_bound(out));if (s2.size() > 0) {s1.insert(*s2.begin());s2.erase(s2.begin());}}else {printf("-1\n");}}}return 0;}