Submission #501906

#	Time	Username	Problem	Language	Result	Execution time	Memory
501906		SirCovidThe19th	Money (IZhO17_money)	C++17	0 / 100	0 ms	204 KiB

money

#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]);

    S.erase(S.find(A[n - 1]));
    for (int i = n - 1; i; i--){ //should we include i and i - 1?
        S.erase(S.find(A[i - 1]));
        auto it = S.upper_bound(A[i - 1]);
        if (A[i - 1] > A[i] or (it != S.end() and *it <= A[i])){
            ans++;
        }
    }
    cout<<ans<<endl;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55