| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364198 | kmath628 | 버블 정렬 (OJUZ10_bubblesort) | C++20 | 32 ms | 3452 KiB |
#include <bits/stdc++.h>
using namespace std;
int a[100009],inv[100009],s[100009];
vector<pair<int,int> > recur(int l, int r){
if(l==r)
return {make_pair(a[l],l)};
int mid=(l+r)/2,p=0,q=0;
vector<pair<int,int> > a=recur(l,mid),b=recur(mid+1,r),c;
while(p<a.size() && q<b.size()){
if(a[p]<b[q]) c.push_back(a[p++]);
else{
inv[b[q].second]+=a.size()-p;
c.push_back(b[q++]);
}
}
while(p<a.size()) c.push_back(a[p++]);
while(q<b.size()) c.push_back(b[q++]);
return c;
}
int main(){
int n,k,i,p=0;
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
recur(1,n);
vector<int> b;
for(i=1;i<=n;i++){
if(inv[i]>=k) s[i-k]=a[i];
else b.push_back(a[i]);
}
sort(b.begin(),b.end());
for(i=1;i<=n;i++){
if(s[i]==0) s[i]=b[p++];
}
for(i=1;i<=n;i++) printf("%d ",s[i]);
printf("\n");
return 0;
}
Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
