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

0 vote275 views1 answer
#defie in c++
C++
0 vote265 views1 answer
Prisma client
C++
2 votes185 views2 answers
Stack algorithm in c++
C++
0 vote174 views1 answer
Modulo subtraction
C++
0 vote165 views1 answer
Get start with c++
C++
17 votes170 views2 answers
Convert string to char c++
C++
0 vote176 views1 answer
C++ iterate over vector of pointers
C++
0 vote193 views1 answer
Split 2d array into chunks in c++
C++
0 vote171 views1 answer
Query for rmq using sqrt decomposition
C++
7 votes178 views6 answers
Sleep in c++
C++