| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364192 | kmath628 | 버블 정렬 (OJUZ10_bubblesort) | C++20 | 1095 ms | 816 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k,i;
scanf("%d %d",&n,&k);
vector<int> a(n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
while(k--){
for(i=0;i<n-1;i++)
if(a[i]>a[i+1]) swap(a[i],a[i+1]);
}
for(i=0;i<n;i++) printf("%d ",a[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... | ||||
