Submission #758098

#TimeUsernameProblemLanguageResultExecution timeMemory
758098vjudge1Money (IZhO17_money)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define int long long #define endl '\n' using namespace std; using namespace __gnu_pbds; using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n; cin>>n; pair<int,int>pr[n]; for(int i=0;i<n;i++){ cin>>pr[i].first; pr[i].second=i; } sort(pr,pr+n); int ans=1; for(int i=1;i<n;i++){ if(pr[i].second<pr[i-1].second)ans++; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...