Submission #778273

#	Time	Username	Problem	Language	Result	Execution time	Memory
778273		danikoynov	정렬하기 (IOI15_sorting)	C++14	0 / 100	6 ms	340 KiB

sorting

#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[]) {
    int R = 0;
    for (int i = 0; i < N; i ++)
    {
        int idx = i;
        for (int j = i + 1; j < N; j ++)
            if (S[j] < S[idx])
            idx = j;

        if (idx == i)
            continue;
        P[R] = i;
        Q[R] = idx;
        R ++;
    }
	return R;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:39: warning: unused parameter 'M' [-Wunused-parameter]
    7 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:7:46: warning: unused parameter 'X' [-Wunused-parameter]
    7 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:7:55: warning: unused parameter 'Y' [-Wunused-parameter]
    7 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~

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