Submission #13956

#	Time	Username	Problem	Language	Result	Execution time	Memory
13956		gs14004	버블 정렬 (OJUZ10_bubblesort)	C++14	0 / 100	54 ms	3628 KiB

bubblesort

#include <cstdio>
#include <queue>
#include <set>
using namespace std;
typedef pair<int,int> pi;

int n,k,a[100005],ret[100005];
bool vis[100005];
priority_queue<pi> pq;

int main(){
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
        pq.push(pi(a[i],i));
    }
    int pt = n-1;
    while (k--) {
        pi t = pq.top();
        pq.pop();
        vis[t.second] = 1;
        ret[pt--] = t.first;
    }
    for (int i=n-1; i>=0; i--) {
        if(!vis[i]){
            ret[pt--] = a[i];
        }
    }
    for (int i=0; i<n; i++) {
        printf("%d ",ret[i]);
    }
}

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