Submission #18592

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

bubblesort

#include<stdio.h>

int data[100000];
int main()
{
	int N, K;
	//freopen("input.txt", "r", stdin);
	scanf("%d %d ", &N, &K);
	for (int i = 0; i < N; i++) {
		scanf("%d ", &data[i]);
	}

	if (K >= N - 1) K = N - 1;
	for (int i = 0; i < K; i++) {
		int change = 0;
		for (int j = 0; j < N - 1 - i; j++) {
			if (data[j] > data[j + 1]) {
				int temp;
				temp = data[j];
				data[j] = data[j + 1];
				data[j + 1] = temp;
				change = 1;
			}
		}
		if (change == 0) break;
	}
	for (int i = 0; i < N; i++) printf("%d ", data[i]);
}

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