lambda comparator - fieldsfarmer/coding_problems GitHub Wiki

// comp is for a priority_queue
auto comp = [&nums1, &nums2](pair<int, int> a, pair<int, int> b) {
            return nums1[a.first] + nums2[a.second] > nums1[b.first] + nums2[b.second];};

auto cmp = [](const pair<int,int>& a, const pair<int,int>& b){
    return a.first<b.first || (a.first==b.first && a.second < b.second);
  }; // here you cannot ommit const and &!! This is in C++11
// if in C++14
auto cmp = [](auto &a, auto &b){
    return a.first<b.first || (a.first==b.first && a.second < b.second);
  };
vector<pair<int,int>> v; 
sort(v.begin(), v.end(), cmp);