关于set的些常用操作记录
#include <bits/stdc++.h>
#define pt2(x,y) cout <<(x)<<"--"<<(y)<<endl;
#define pt1(x) cout <<"#"<<(x)<<"#"<<endl;
#define hh cout << "\n"
#define rep(i,a,n) for(int i = (a); i <= int(n); i++)
#define per(i,a,n) for(int i = (n); i >= int(a); i--)
#define fi first;
#define se second;
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef double DB;
const int N=1e9,M=1e6+10,INF=0x3f3f3f3f;
int t=1;
void solve()
{
set<int> s;
s.insert(1);
s.insert(3);
s.insert(5);
s.insert(-5);
for(auto ss:s) cout << ss<<" ";
hh;
s.erase(5);
for(auto ss:s) cout << ss<<" ";
hh;
cout << s.count(1)<<endl;
cout << s.count(2) <<endl;
cout << *s.begin()<<endl;
cout << *s.end()<<endl;
cout <<"size :"<< s.size()<<endl;
s.clear();
cout <<"size :"<< s.size()<<endl;
}
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
while(t--)
{
solve();
}
return 0;
}