| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 501900 | SirCovidThe19th | Money (IZhO17_money) | C++17 | 0 ms | 292 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;
int main(){
int n; cin >> n; int A[n], ans = 1; multiset<int> S;
for (int i = 0; i < n; i++) cin >> A[i], S.insert(A[i]);
for (int i = n - 1; i; i--){ //should we include i and i - 1?
if (A[i - 1] > A[i] or *next(S.find(A[i - 1])) != A[i]) ans++;
S.erase(S.find(A[i]));
}
cout<<ans<<endl;
}| # | 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... | ||||
