Submission #19109

#	Time	Username	Problem	Language	Result	Execution time	Memory
19109		Namnamseo	버블 정렬 (OJUZ10_bubblesort)	C++14	0 / 100	281 ms	1980 KiB

bubblesort

#include <cstdio>
#include <queue>
using namespace std;
int n,k,buf;
priority_queue<int> pq;
queue<int> q;
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=0;i<=k;++i) scanf("%d",&buf), pq.push(-buf);
    for(;pq.size();){
        printf("%d ",-pq.top()); pq.pop();
        if(scanf("%d",&buf)==1) pq.push(-buf);
    }
    return 0;
}

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