Pagini recente » Borderou de evaluare (job #1623218) | Cod sursa (job #3231836) | Cod sursa (job #125125) | Cod sursa (job #1663426) | Cod sursa (job #2311502)
#include <iostream>
#include <fstream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using mega_tree = tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update >;
ifstream in("nums.in");
ofstream out("nums.out");
int n;
int p, x;
mega_tree mt;
int main()
{
in >> n;
for(int i = 1; i <= n; i++) {
in >> p >> x;
if(p == 0) {
out << *mt.find_by_order(x - 1) << '\n';
} else if(p == 1) {
mt.insert(x);
}
}
in.close();
out.close();
return 0;
}