Custom Comparators in Sorting

Medium STL Algorithms

Solve in Playground →

Problem Statement

Write a C++ program using `std::sort` with a custom lambda comparator to sort integers in descending order.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print elements sorted in descending order separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
10 40 20 50 30

Sample Output

50 40 30 20 10

Explanation

Custom comparators enable defining arbitrary ordering rules for STL sorting algorithms.

Starter Code

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int n;
    if (std::cin >> n) {
        std::vector<int> vec(n);
        for (int i = 0; i < n; i++) std::cin >> vec[i];
        
        // Write your custom comparator sorting logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →