# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434481 | ismoilov | Sorting (IOI15_sorting) | 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 "sorting.h"
#include <bits/stdc++.h>
using namespace std;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
for(int i = 0; i < n; i ++){
int x = i;
for(int j = 0; j < n; j ++){
if(a[j] == i){
p[i] = j, q[i] = i, swap(s[j], s[i]);
break;
}
}
}
return n;
}