제출 #14610

#제출 시각아이디문제언어결과실행 시간메모리
14610caphile98버블 정렬 (OJUZ10_bubblesort)C++98
0 / 100
46 ms2256 KiB
#include <stdio.h> #define MAX 100001 int arr[MAX]; int brr[MAX]; int check[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; for (i = 1; i <= k; i++) { for (j = 1; j < e; j++) { if (check[j] == 1 || check[j + 1] == 1) continue; if (arr[j]>arr[j + 1]) { temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } for (i = 1; i < e; i++) { if (arr[i] == brr[i]) check[i] = 1; brr[i] = arr[i]; } 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...