Submission #14142

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

bubblesort

#include<stdio.h>
int b[100005],n,k;
int main(){
    int temp,i,j;
    scanf("%d %d",&n,&k);
    for(i=0;i<n;i++) scanf("%d",&b[i]);
    for(i=1;i<=k;i++){
        for(j=0;j<n-i;j++){
            if(b[j]>b[j+1]){
                temp=b[j];
                b[j]=b[j+1];
                b[j+1]=temp;
            }
        }
    }
    for(i=0;i<n;i++) printf("%d ",b[i]);
    return 0;
}

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