Submission #758263

#TimeUsernameProblemLanguageResultExecution timeMemory
758263haxormanMoney (IZhO17_money)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1e6 + 7;

int arr[mxN];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    int n;
    cin >> n;

    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    arr[n] = INT_MIN;
        
    int ans = 0;
    multiset<int> vals;
    for (int i = 0; i < n; ++i) {
        vals.insert(arr[i]);
        auto it = vals.upper_bound(arr[i]);
        if (arr[i] > arr[i + 1] || (it != vals.end() && *it < arr[i + 1])) {
            ++ans;
            continue;
        }
    }
    cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...