Submission #14283

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

bubblesort

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

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