notes/OJ notes/pages/cpp_std_multiset.md

# Multiset

#### 2022-06-12

---

##### Data structures:

#DS #multiset

##### Difficulty:

#CS_analysis #difficulty_easy

##### Related problems:

##### Links:

- [cppreference](https://en.cppreference.com/w/cpp/container/multiset)

---

### What is Multiset?

`std::multiset` is an associative container that contains a sorted set of objects of type Key. Unlike set, multiple keys with equivalent values are allowed. Sorting is done using the key comparison function Compare. Search, insertion, and removal operations have logarithmic complexity.
Initial commit 2022-06-14 23:33:35 +08:00			`# Multiset`

			`#### 2022-06-12`

vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00			`---`

Initial commit 2022-06-14 23:33:35 +08:00			`##### Data structures:`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
Initial commit 2022-06-14 23:33:35 +08:00			`#DS #multiset`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
Initial commit 2022-06-14 23:33:35 +08:00			`##### Difficulty:`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
vault backup: 2022-09-06 20:22:48 2022-09-06 20:22:48 +08:00			`#CS_analysis #difficulty_easy`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
Initial commit 2022-06-14 23:33:35 +08:00			`##### Related problems:`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
Initial commit 2022-06-14 23:33:35 +08:00			`##### Links:`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
Initial commit 2022-06-14 23:33:35 +08:00			`- [cppreference](https://en.cppreference.com/w/cpp/container/multiset)`
vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00
			`---`
Initial commit 2022-06-14 23:33:35 +08:00
			`### What is Multiset?`

vault backup: 2022-09-03 15:41:35 2022-09-03 15:41:36 +08:00			`std::multiset` is an associative container that contains a sorted set of objects of type Key. Unlike set, multiple keys with equivalent values are allowed. Sorting is done using the key comparison function Compare. Search, insertion, and removal operations have logarithmic complexity.