# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889083 | svaz | Arranging Shoes (IOI19_shoes) | C++14 | 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 n,zap;
long long count_swaps(vector<int>S){
if(n==1){
if(S[0]<S[1])return 0;
return 1;
}
return n/2;
}
int main()
{
cin>>n;
vector<int> zapatos(n);
for(int i=0;i<n;i++){
cin>>zapatos[i];
}
cout<<count_swaps(zapatos)<<"\n";
}