Submission #14085

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

bubblesort

#include <stdio.h>
#include <algorithm>

using namespace std;

int n, k, m[100010];

int main() {
    int p, i;
    scanf("%d %d", &n, &k);
    for(i=0;i<n;i++) {
        scanf("%d", &m[i]);
    }
    for(p=0;p<k;p++) {
        for(i=0;i<n-1;i++) {
            if(m[i]>m[i+1]) swap(m[i], m[i+1]);
        }
    }
    for(i=0;i<n;i++) {
        printf("%d ", m[i]);
    }
    printf("\n");
    return 0;
}

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