Submission #14612

#TimeUsernameProblemLanguageResultExecution timeMemory
14612caphile98버블 정렬 (OJUZ10_bubblesort)C++98
34 / 100
1000 ms1864 KiB
#include <stdio.h> #define MAX 100001 int arr[MAX]; int brr[MAX]; int main() { int n, k; scanf("%d%d", &n, &k); int i, j; for (i = 1; i <= n; i++) { scanf("%d", &arr[i]); brr[i] = arr[i]; } int temp; int e = n; int l; int a; for (i = 1; i <= k; i++) { a = 0; for (j = 1; j < e; j++) { if (arr[j]>arr[j + 1]) { temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } else { a += 1; if (a == e) break; } } e -= 1; } for (i = 1; i <= n; i++) printf("%d ", arr[i]); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...