# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38094 | nibnalin | Money (IZhO17_money) | C++14 | 0 ms | 5920 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 <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = int(1e6)+5;
int A[maxn];
int main(void)
{
int n;
scanf("%d", &n);
vector<pair<int, int>> B;
for(int i = 0;i < n;i++)
{
scanf("%d", &A[i]);
B.push_back({A[i], i});
}
sort(B.begin(), B.end());
int res = bool(B[0].second);
for(int i = 1;i < n;i++)
{
if(B[i].second < B[i-1].second) res++;
}
printf("%d\n", res);
}
Compilation message (stderr)
# | 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... |