Submission #14118

#TimeUsernameProblemLanguageResultExecution timeMemory
14118kyungjun2버블 정렬 (OJUZ10_bubblesort)C++98
0 / 100
33 ms1356 KiB
#include<stdio.h> int main(){ int n,k,i,j; scanf("%d %d",&n,&k); int arr[n]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } for(i=0;i<=n*k;i++){ if(arr[i+1]<arr[i]){ int t=arr[i+1]; arr[i+1]=arr[i]; arr[i]=t; } } for(i=0;i<n;i++){ printf("%d ",arr[i]); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...