Submission #14436

#	Time	Username	Problem	Language	Result	Execution time	Memory
14436		gs14004	버블 정렬 (OJUZ10_bubblesort)	C++14	100 / 100	63 ms	2372 KiB

bubblesort

#include <cstdio>
#include <queue>
using namespace std;

int n, k, a[100005];
priority_queue<int,vector<int>,greater<int> > pq;

int main(){
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    for (int i=0; i<k; i++) {
        pq.push(a[i]);
    }
    for (int i=0; i<n; i++) {
        if(i + k < n){
            pq.push(a[i + k]);
        }
        printf("%d ",pq.top());
        pq.pop();
    }
}

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