fork download
copy 
  1. #include <iostream>
  2. #include <fstream>
  3. #include<map>
  4. #include<algorithm>
  5. using namespace std;
  6.  
  7.  
  8. struct A {
  9. };
  10.  
  11. struct comp {
  12. bool operator()(const std::pair<int, int>&x, const std::pair<int, int>& y ) const
  13. {
  14.     return x.second < y.second;
  15. }
  16. };
  17.  
  18. int main(){
  19.  
  20. int search_id=1;
  21. std::map<std::pair<int, int>, struct A > myMap;
  22. struct A a;
  23. myMap.insert(std::make_pair(std::pair<int, int>(1, 200), a));
  24. myMap.insert(std::make_pair(std::pair<int, int>(1, 202), a));
  25. myMap.insert(std::make_pair(std::pair<int, int>(1, 198), a));
  26. myMap.insert(std::make_pair(std::pair<int, int>(2, 207), a));
  27.  
  28.  
  29. auto it=std::find_if(myMap.begin() , myMap.end() , 
  30.                 [search_id](const std::pair<std::pair<int, int>, A>& x)
  31.                 { return x.first.first == search_id; } 
  32.                 );
  33.  
  34. if(it != myMap.end())
  35. {
  36. std::cout<<it->first.first<<" "<<it->first.second;
  37. }
  38. }
Success #stdin #stdout 0s 3428KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1 198
https://ideone.com/KaNZqS
language:
C++14 (gcc 8.3)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!