# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
621009 | A_D | 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;
const int N=2e5+100;
int a[N];
int n;
int num=0;
vector<int> vec1;
vector<int> vec2;
void mer(int l,int r)
{
/*
if(l==r)return;
int mid=(l+r)/2;
mer(l,mid);
mer(mid+1,r);
int l1=l;
int l2=mid+1;
while(l1<=mid&&l2<=r){
if(a[l1]>a[l2]){
}
}
*/
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
num=0;
n=N;
for(int i=0;i<N;i++){
a[i]=A[i];
}
// mer(0,n-1);
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
if(a[j+1]<a[j]){
swap(a[j],a[j+1]);
P[num]=j;
Q[num]=j+1;
num++;
}
}
}
num--;
return num;
}