Submission #18930

#	Time	Username	Problem	Language	Result	Execution time	Memory
18930		chan492811	버블 정렬 (OJUZ10_bubblesort)	C++98	0 / 100	47 ms	1980 KiB

bubblesort

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

int n,m;
priority_queue<int,vector<int>,greater<int> > pq;

int main(){
    int i,a;
    scanf("%d %d",&n,&m);
    for(i=0;i<=m;i++) scanf("%d",&a),pq.push(a);
    for(i=m+1;i<n;i++){
        printf("%d ",pq.top()); pq.pop(); scanf("%d",&a); pq.push(a);
    }
    while(!pq.empty()) printf("%d ",pq.top()),pq.pop();
    return 0;
}

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