Submission #501900

#TimeUsernameProblemLanguageResultExecution timeMemory
501900SirCovidThe19thMoney (IZhO17_money)C++17
0 / 100
0 ms292 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...