Remove duplicate elements in an Array using STL in C++

How to Store Duplicate Elements in Ordered Set in C++?

Last Updated : 03 Dec, 2024

The ordered set is a policy-based data structure in GNU C++ that contains unique elements in sorted order just like set. In this article, we will learn how to store duplicates in ordered set.

To store duplicates in an ordered set, use a pair data type where the first value of the pair will store the element, and the second value will store some other unique information like index or even some random number. Let’s take a look at an example:

C++

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

// Declaring ordered_set for pair<int,int>
typedef tree<pair<int, int>, null_type, 
less<pair<int, int>>, rb_tree_tag, 
tree_order_statistics_node_update> os;

int main() {
    vector<int> v = {1, 2, 2, 1, 3};
  
  	// Creating ordered set
    os s;

    // Inserting duplicate elements in 
    // ordered set
    for (int i = 0; i < v.size(); i++)
        s.insert({v[i], i});

    for (auto i : s)
        cout << i.first << " ";
    return 0;
}

Output

1 1 2 2 3

Explanation: In the above code, storing duplicate elements in an ordered set pair with a unique second value will make the pair different from one another.

Remove duplicate elements in an Array using STL in C++

S

sachin801

Improve

Article Tags :

Practice Tags :

Similar Reads

How to insert elements in C++ STL List ?

List has been discussed in many articles, but the sole purpose of this article is to cover all types of insertions that are possible to be carried in a list container and to give a detailed insight on the insertion operations. List and its many functions are defined under the header file "list" . Va

How to Insert a Range of Elements in a Set in C++ STL?

Prerequisites: Set in C++ Sets in C++ are a type of associative container in which each element has to be unique because the value of the element identifies it. The values are stored in a specific sorted order i.e. either ascending or descending. Syntax: set<datatype> set_name; Some Basic Func

Remove duplicate elements in an Array using STL in C++

Given an array, the task is to remove the duplicate elements from the array using STL in C++ Examples: Input: arr[] = {2, 2, 2, 2, 2} Output: arr[] = {2} Input: arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5} Output: arr[] = {1, 2, 3, 4, 5} Approach: This can be done using set in standard template library. Set

Different Ways to Insert Elements in Set in C++ STL

Prerequisites: Set in C++ The C++ Standard Template Library offers containers called Sets. It functions essentially in the same ways as a binary search tree and is used to store different elements in increasing/decreasing order. There are different methods to insert elements in the set as mentioned

How to Erase Duplicates and Sort a Vector in C++?

In this article, we will learn how to remove duplicates and sort a vector in C++. The simplest method to remove the duplicates and sort the vector is by using sort() and unique() functions. Letâ€™s take a look at an example: [GFGTABS] C++ #include <bits/stdc++.h> using namespace std; int main()

Remove duplicates from a string using STL in C++

Given a string S, remove duplicates in this string using STL in C++ Examples: Input: Geeks for geeks Output: Gefgkors Input: aaaaabbbbbb Output: ab Approach: The consecutive duplicates of the string can be removed using the unique() function provided in STL. Below is the implementation of the above

How to traverse a C++ set in reverse direction

Given a Set, the task is to traverse this Set in reverse order. Examples: Input: set = [10 20 30 70 80 90 100 40 50 60] Output: 100 90 80 70 60 50 40 30 20 10 Input: set = [1 2 3 4 5] Output: 5 4 3 2 1 Approach: To traverse a Set in reverse order, a reverse_iterator can be declared on it and it can

Sort Vector of Pairs in descending order in C++

We have discussed some of the cases of sorting vector of pairs in below set 1. Sorting Vector of Pairs in C++ | Set 1 (Sort by first and second) More cases are discussed in this article. Sometimes we require to sort the vector in reverse order. In those instances, rather than first sorting the vecto

How to create an unordered_map of user defined class in C++?

unordered_map is used to implement hash tables. It stores key value pairs. For every key, a hash function is computed and value is stored at that hash entry. Hash functions for standard data types (int, char, string, ..) are predefined. How to use our own data types for implementing hash tables?unor

unordered_set emplace_hint() function in C++ STL

The unordered_set::emplace_hint() function is an inbuilt function in C++ STL which inserts a new element in the unordered_set only if the value to be inserted is unique, with a given hint. Syntax: unordered_set_name.emplace_hint( position, value ) Parameter: This function accepts two parameters as m