Module: Sorting with comparator


Problem

6/11

Sorting a vector through a function object

Theory Click to read/hide

you can also specify a function object as a comparator, which you can create before calling the sort function.
For example:

struct {
        bool operator()(int a, int b) const
        {
            return a < b;
        }
    }cmp;

Problem

You are given a sequence of integers. Write a program that creates and sorts an array in descending order.
 
Input
First given number N — the number of elements in the array (1<=N<=100). Further, through the space, N numbers are written — array elements. The array consists of integers.
 
Output
It is necessary to output an array sorted in descending order.
 
Input Output
5
4 56 23 67 100 		100 67 56 23 4

time 1000 ms
memory 32 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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;


bool cmp(int first, int second) { 
}

int main() {


int N;

cin >> N;
vector<int> A (N);


    for(int i = 0; i < N; i++)
        cin>>A[i];
		        
    sort(A.begin(), A.end(), cmp );

    for(int i = 0;i< N; i ++)
      cout<<A[i]<<" ";

    
}

     

Program check result

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