D - Sequence Query

最新推荐文章于 2022-02-27 10:42:13 发布

whitewall_9

最新推荐文章于 2022-02-27 10:42:13 发布

阅读量133

点赞数

分类专栏：练习题目文章标签：在线编程序列查询集合操作 C++ 算法竞赛

本文链接：https://blog.csdn.net/qq_28409093/article/details/123157942

版权

练习题目专栏收录该内容

340 篇文章 1 订阅

订阅专栏

// Problem: D - Sequence Query
// Contest: AtCoder - AtCoder Beginner Contest 241（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc241/tasks/abc241_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 2022-02-26 21:33:52
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
#define int long long
void solve() {
	map<int, int> cnt;
	
}
signed main () {
    int t;
    t =1;
    cin >> t;
    multiset<int> s;
    while (t --) {
    	int op;
    	cin >> op;
    	if (op == 1) {
    		int x;
    		cin >> x;
    		s.insert(x);
    	}
    	else if (op == 2) {
    		int x, k;
    		cin >> x >> k;
    		auto it = s.upper_bound(x);
    		for (;k > 0 && it!=s.begin(); --k) it --;
    		if (k > 0) {
    			puts("-1");
    		}
    		else {
    			cout << *it << endl;
    		}
    	}
    	else {
    		int x, k;
    		cin >> x >> k;
    		auto it = s.lower_bound(x);
    		if (it == s.end()) {
    			puts("-1");
    			continue;
    		}
    		for (;k > 1 && next(it)!=s.end(); --k) it ++;
    		if (k > 1) {
    			puts("-1");
    		}
    		else {
    			cout << *it << endl;
    		}
    	}
    }
   	// for (auto t : s) cout << t << " ";
   	// puts("");
    return 0;
}

next(it)表示下一个迭代器注意k=0,k=1的区别，