# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288662 | aryan12 | Arranging Shoes (IOI19_shoes) | 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 count_swaps(int a[]) {
if(a[0] > a[1])
return 1;
return 0;
}
/*int main() {
int n;
cin >> n;
int a[n * 2];
for(int i = 0; i < n * 2; i++) {
cin >> a[i];
}
count_swaps(a);
}*/