Submission #1302530

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302530		nathlol2	Sorting (IOI15_sorting)	C++20	20 / 100	5 ms	572 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;

int findSwapPairs(int N, int a[], int M, int X[], int Y[], int P[], int Q[]) {
    int k = 0;
    for(int i = 0;i < N - 1;i++){
        int id = i;
        for(int j = i + 1;j < N;j++){
            if(a[j] < a[id]) id = j;
        }
        if(id != i){
            swap(a[i], a[id]);
            P[k] = i;
            Q[k] = id;
            k++;
        }
    }
    return k;
}

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26