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)
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 161 |
3 | Um_nik | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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';
}
Name |
---|