Pagini recente » Cod sursa (job #337320) | Cod sursa (job #2804705) | Cod sursa (job #1554099) | Cod sursa (job #1295097) | Cod sursa (job #1336004)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <limits>
#include <sstream>
#include <deque>
#include <bitset>
#include <complex>
#include <functional>
#include <memory>
#include <numeric>
#define x first
#define y second
typedef std::pair<int, int> pii;
using namespace std;
int a, b, Max = 1<<30;
vector<int> vel;
int main () {
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n, ok = 1;
fin >> n;
for(int i = 0; i < n; i++)
{
fin >> a;
if(a == 3)
{
Max = 1<<30;
for(int i = 0; i < vel.size(); i++)
if(Max > vel[i])
Max = vel[i];
fout << Max << "\n";
}
else
{
fin >> b;
if(a == 1)
{
vel.push_back(b);
}
if(a == 2)
{
vel.erase(vel.begin() + (b - ok));
ok++;
}
}
}
//for(int i = 0; i < vel.size(); i++)
//fout << vel[i] << " ";
return 0;
}