# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763437 | KN200711 | Money (IZhO17_money) | C++14 | 1580 ms | 296 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
using namespace std;
multiset<int> C;
int main() {
int N;
scanf("%d", &N);
vector<int> arr(N);
map<int, int> MM;
for(int i=0;i<N;i++) {
scanf("%d", &arr[i]);
C.insert(arr[i]);
}
int ans = 0;
for(int i=N-1;i>=0;i--) {
auto p = C.lower_bound(arr[i]);
int x = C.count(arr[i]);
int k = i - 1, cnt = 1;
while(k >= 0 && arr[k] == arr[k + 1]) {
cnt++;
k--;
}
// cout<<*p<<endl;
bool ed = 0;
if(p == C.begin()) ed = 1;
else p--;
while(cnt--) C.erase(C.find(arr[i]));
if(ed) {
ans++;
continue;
}
while(k >= 0 && *p == arr[k]) {
// cout<<k<<" "<<arr[k]<< endl;
auto q = p;
if(k != 0) q--;
C.erase(p);
if(k != 0) p = q;
k--;
// cout<<*p<<endl;
}
// cout<<k<<endl;
i = k + 1;
ans++;
}
printf("%d\n", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |