Submission #15746

#	Time	Username	Problem	Language	Result	Execution time	Memory
15746		comet	버블 정렬 (OJUZ10_bubblesort)	C++98	100 / 100	59 ms	2372 KiB

bubblesort

#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int n,m,a[100010];
priority_queue<int,vector<int>,greater<int> >Q;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	for(int i=0;i<m;i++)Q.push(a[i]);
	for(int i=m;i<n;i++){
		Q.push(a[i]);
		printf("%d\n",Q.top());
		Q.pop();
	}
	while(!Q.empty()){
		printf("%d\n",Q.top());
		Q.pop();
	}
	return 0;
}

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