Module: Associative arrays: map


Problem

3/9

Sorted Lists #2

Theory Click to read/hide

There is no simple solution to sort by value, so you have to make a vector of pairs from a dictionary, and sort it using a comparator.

Problem

Build an alphabetic-frequency dictionary sorted by word frequency: a list of words, to the right of each word should indicate how many times it occurs in the source file in descending order. If the number of words is the same, the sort is word by word in lexicographic order. The sign of the end of the text is "END!". 
 
Input Output
one
two
three
one
two
two 2
one 2
three 1
 

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include<iostream>
#include<vector>
#include <string>
#include <map>
#include <algorithm>
using namespace std;


bool cmp(const pair<string, int>& first,
	const pair<string, int>& second)
{        
}


int main()
{

	map<string, int> mymap;
	string s;
	while (!cin.eof())
	{
		cin>>s;
                 if (s == "END!")
			break;
		mymap[s]++;
	}
	
	vector<pair <string, int> > B( mymap.begin(), mymap.end());
        
	for (int i = 0; i < B.size(); i++)
	{
		cout << B[i].first << " " << B[i].second << endl;

	}
	return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!