set和multiset的用法

set

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string.h>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
using namespace std;
//vector学习 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
     freopen("in.txt","r",stdin);
   set<int> se;
   int x,n;
     printf("输入n:\n"); 
     cin>>n;
     for(int i=0;i<n;i++)
     {
        cin>>x;
        se.insert(x);
      } 
      cout<<"有多少个元素:\n";
      cout<<se.size()<<endl;
      cout<<"遍历set:\n";
      for(set<int>::iterator i=se.begin();i!=se.end();i++)
      cout<<*i<<' ';
      cout<<endl;
      cout<<"有多少个5在里面:\n";
      cout<<se.count(5)<<endl;
      cout<<"是否存在112和23:\n";
      cout<<*se.find(112)<<' '<<*se.find(23)<<endl;
      cout<<"查找第一个大于或等于5\n";
      cout<<*se.lower_bound(5)<<endl;
      cout<<"查找第一个大于5的下:\n";
      cout<<*se.upper_bound(5)<<endl;

    return 0;
}

multiset

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string.h>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
using namespace std;
//vector学习 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
     freopen("in.txt","r",stdin);
   multiset<char> se;
   int n;
   char x;
     printf("输入n:\n"); 
     cin>>n;
     for(int i=0;i<n;i++)
     {
        cin>>x;
        se.insert(x);
      } 
      cout<<"有多少个元素:\n";
      cout<<se.size()<<endl;
      cout<<"遍历set:\n";
      for(set<char>::iterator i=se.begin();i!=se.end();i++)
      cout<<*i<<' ';
      cout<<endl;
      cout<<"有多少个5在里面:\n";
      cout<<se.count('c')<<endl;
     
    return 0;
}

转载于:https://www.cnblogs.com/mch5201314/p/10557957.html