# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
358073 | Sparky_09 | Sorting (IOI15_sorting) | 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;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
#include "sorting.h"
int findSwapPairs(int n,int s[],int m,int x[],int y[],int P[],int Q[]){
int ans = 0;
int wh=0;
for(int i = 0; i < n; i++){
int m = i;
for(int j = il j < n; j++){
if(s[j] < s[m]){
m = j;
}
}
if(i!=m) ans++;
if(i!=m){ P[wh]=i; Q[wh]=m; wh++; }
swap(i, m);
}
return ans;
}