Submission #14063

#	Time	Username	Problem	Language	Result	Execution time	Memory
14063		kipa00	버블 정렬 (OJUZ10_bubblesort)	C++98	34 / 100	1000 ms	1472 KiB

bubblesort

#include <cstdio>

int arr[100000];
int main() {
    int N, K, i, j;
    scanf("%d %d", &N, &K);
    for (i=0; i<N; ++i) {
        scanf("%d", arr+i);
    }
    for (i=0; i<K; ++i) {
        for (j=1; j<N; ++j) {
            if (arr[j-1] > arr[j]) {
                arr[j-1] ^= arr[j] ^= arr[j-1] ^= arr[j];
            }
        }
    }
    for (i=0; i<N; ++i) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 0 / 47
• Subtask 4: 0 / 19