Submission #15641

#	Time	Username	Problem	Language	Result	Execution time	Memory
15641		ggoh	버블 정렬 (OJUZ10_bubblesort)	C++98	100 / 100	85 ms	6456 KiB

bubblesort

#include<cstdio>
#include<set>
int a,b,i,x[160001];
std::multiset<int>S;
main()
{
    scanf("%d%d",&a,&b);
    for(i=0;i<a;i++)
    {
        scanf("%d",&x[i]);
        if(i<=b)S.insert(x[i]);
    }
    for(i=0;i<a;i++)
    {
    	std::multiset<int>::iterator t=S.begin();
    	printf("%d ",*t);
    	S.erase(t);
        if(i+b+1<a)S.insert(x[i+b+1]);
    }
}

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