Problem statement here.
- Why is this code not correct?
code
- How to compute the minimum number of rounds required? (this is not asked in that question)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
3 | cry | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
Related to CSES — Collecting Numbers
Problem statement here.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin>>n;
set<int> ending_nums;
int x;
cin>>x; ending_nums.insert(x);
for (int i=1; i<n; i++) {
cin>>x;
if(x > *ending_nums.begin()) {
ending_nums.erase(ending_nums.begin());
}
ending_nums.insert(x);
}
cout << ending_nums.size() << '\n';
}
Название |
---|