# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332342 | nicholask | 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>
#define int long long
using namespace std;
int count_swaps(vector <int> s){
if (s[0]>s[1]) return 1;
else return 0;
}
/*
signed main(){
int n;
cin>>n;
vector <int> v(n);
for (int i=0; i<n; i++) cin>>v[i];
cout<<solve(v);
}
*/