# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570156 | Santos_Rivera | Road Closures (APIO21_roads) | C++17 | 0 ms | 0 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<bits/stdc++.h>
using namespace std;
int izq(vector<int> v, int n,int m,int a){
int cont=0;
for(int i=0;i<m;i++){
if(v[i]<a){
for(int j=m+1;j<n;j++){
if(v[j]<a){
cont++;
}
}
}
}
return cont;
}
int main(){
int n,x,cont=0;
cin>>n;
vector<int> v;
v.reserve(n);
for(int i=0;i<n;i++){
cin>>x;
v.push_back(x);
}
for(int i=0;i<n-1;i++){
cont+=izq(v,n,i,v[i]);
}
cout<<cont<<endl;
}