Cod sursa(job #743373)
Utilizator | Data | 4 mai 2012 01:16:54 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
multiset <int> S;
int main()
{
int n,tip,val,i;
f>>n;
for(i=1; i<=n; ++i)
{
f>>tip>>val;
if (tip==1) S.insert(val);
if (tip==2) S.erase(val);
if (tip==3)
{
if (S.find(val)!=S.end())
g<<1<<'\n';
else g<<0<<'\n';
}
}
f.close();
g.close();
return 0;
}