Submission #15642

#	Time	Username	Problem	Language	Result	Execution time	Memory
15642		ggoh	버블 정렬 (OJUZ10_bubblesort)	C++98	0 / 100	92 ms	5828 KiB

bubblesort

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

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