Submission #13959

#	Time	Username	Problem	Language	Result	Execution time	Memory
13959		tncks0121	버블 정렬 (OJUZ10_bubblesort)	C++14	34 / 100	1000 ms	1472 KiB

bubblesort

#include <stdio.h>
 
int n, k, a[100005];
 
int main() {
  scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++) scanf("%d", a+i);
 
  for(int j = 1; j <= k; j++) {
    for(int i = 1; i <= n-j; i++) {
      if(a[i] > a[i+1]) {
        int t = a[i];
        a[i] = a[i+1];
        a[i+1] = t;
      }
    }
  }
   
for(int i = 1; i <= n; i++) printf("%d ", a[i]);
   
     
  return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 0 / 47
• Subtask 4: 0 / 19