Maximum value in map in c++

auto x = std::max_element(m.begin(), m.end(),
    [](const pair<int, int>& p1, const pair<int, int>& p2) {
        return p1.second < p2.second; });

Source: stackoverflow.com

Maximum value in map in c++

#include <bits/stdc++.h>
using namespace std;

bool compare(const pair<int, int>&a, const pair<int, int>&b)
{
   return a.second<b.second;
}

int main(int argc, char const *argv[])
{
   int n, key, maxn;
   map<int,int> mp;

   cin>>n;

   for (int i=0; i<n; i++)
   {
     cin>>key;
     mp[key]++;
   }

   maxn = max_element(mp.begin(), mp.end(), compare)->second;

   cout<<maxn<<endl;

   return 0;
 }

Source: stackoverflow.com

Similar codes

1 vote211 views1 answer
How to substract to give a positive outcome in c++
C++
3 votes156 views2 answers
Console colors in C++
C++
5 votes156 views1 answer
Qdebug
C++
4 votes166 views3 answers
C++ how to get maximum value
C++
0 vote192 views1 answer
C++ caps lock key
C++
-1 vote190 views1 answer
Templates of templates c++
C++
2 votes153 views1 answer
Endl in c++ means
C++
3 votes153 views5 answers
Euclid algorithm
C++
0 vote162 views1 answer
Stack implementation through linked list
C++
0 vote164 views1 answer
How to adjust and delete memory in c, c++
C++