Question

:Pls help for this programing problem in c++ (standard IO without file read/write),better with some comment about why coding that way,thanks

Problem A: Counting Numbers Problem Description Write a program that reads numbers from the keyboard into an integer array. You may assume that there will be 50 or fewer entries in the array. Your program allows any number of numbers to be entered, up to 50 numbers. The output is to be a two-column list. The first column is a list of the distinct array elements; the second column is the count of the number of occurrences of each element. The list should be sorted on entries in the first column, largest to smallest. Input The first line contains an integer m which indicates the number of test cases. And the following is the m test cases. For each test cases, user can key in n number (n 50), and end input by key in -999 Output The output is to be a two-column list. The first column is a list of the distinct array elements; the second column is the count of the number of occurrences of each element. The list should be sorted on entries in the first column, largest to smallest. The output between two cases are separated by a empty line Sample Input Sample Output 1231214-999 3 1 12 3-12 4 11 12 1-112342 3-12-999 2 12 4

Answer 1

#include <iostream>

#include <map>

#include <iterator>

using namespace std;

int main()

{

int test=0;

cin >>test;

while(test-->0){

map <int, int> m;

int i=0;

while(true){

cin >> i;

if (i==-999){

break;

}

m[i]=m[i]+1;

}

map <int, int> :: iterator itr;

itr = m.end();

itr--;

for (; itr != m.begin(); --itr){

cout << itr->first<<'\t' << itr->second << '\n';

}

cout << itr->first<<'\t' << itr->second << '\n';

cout << endl;

}

}

//int map is already sorted based on keys