imp.md

sort(a.begin(), a.end(), sortbysecdesc);
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}

Scam

• E:\blue\cpp-book\src\Searching-and-Sorting\SortingAccordingToTheirOccurances.cpp

Leetcode:

• 316*
• 199
• 238
• 65
• 71
• 119
• 594
• 1592
• 1664
• 902
• 669
• https://leetcode.com/problems/ones-and-zeroes/

cf:

• H:\cpp-book\src\Codeforces\unique-bid-auction.cpp
• ball-of-steel
• Errich-Tac-Toe(Easy-Hard)
• Rating-Compression(Got TLE)
• https://codeforces.com/contest/1499/problem/D
• https://codeforces.com/contest/1551/problem/B2 - Wonderful Coloring - ii

cc:

CNDYGAME

AtCoder

• H:\cpp-book\src\AtCoder\increment-of-coins.cpp
• H:\cpp-book\src\AtCoder\programming-contest.cpp

Map

sort-array-by-increasing-frequency

Make Pair(make_pair)

sort-array-by-increasing-frequency