Remove Duplicates using Set

Easy STL Containers

Solve in Playground →

Problem Statement

Write a C++ program to remove duplicate elements from an unsorted vector using `std::set` while preserving sorted order.

Input Format

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

Output Format

Print unique sorted elements separated by a space.

Constraints

1 <= N <= 1000

Sample Input

6
40 10 30 10 20 40

Sample Output

10 20 30 40

Explanation

Inserting vector elements into a set automatically removes duplicates and sorts them.

Starter Code

#include <iostream>
#include <vector>
#include <set>

int main() {
    int n;
    if (std::cin >> n) {
        // Write your set duplicate removal logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →