# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889086 | 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 "shoes.h"
#include<iostream>
#include<vector>
using namespace std;
long long count_swaps(std::vector<int> S){
if(S.size()==2){
if(S[0]>s[1])return 1;
return 0;
}
return S.size()/2;
}
/*int main(){
int n,zap;
cin>>n;
for(int i=0;i<n*2;i++){
cin>>zap;
zapatos.push_back(zap);
}
cout<<count_swaps(zapatos)<<"\n";
return 0;
}*/