Submission #14213

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

bubblesort

#include<cstdio>
#include<algorithm>
using namespace std;
int n,k,a[100005];
int main()
{
    int i,j,t;
    scanf("%d%d",&n,&k);
    for(i=0;i<n;i++)scanf("%d",&a[i]);
    for(i=0;i<k;i++)
        for(j=0;j<n-1;j++)
            if(a[j]>a[j+1]){
                t=a[j];
                a[j]=a[j+1];
                a[j+1]=t;
            }
    for(i=0;i<n;i++)printf("%d ",a[i]);
}

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