Submission #1302471

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302471		nathlol2	Sorting (IOI15_sorting)	C++20	0 / 100	3 ms	348 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[]) {
    for(int i = 0;i<N;i++){
		int mn = a[i], id = i;
		for(int j = i + 1;j<N;j++){
			if(a[j] < mn){
				mn = a[j];
				id = j;
			}
		}
		P[i] = i, Q[i] = id;
	}
	return M;
}

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