Submission #14614

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

bubblesort

#include <stdio.h>
#define MAX 100001
int arr[MAX];

int main()
{
	int n, k;
	scanf("%d%d", &n, &k);

	int i, j;
	for (i = 1; i <= n; i++)
		scanf("%d", &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 - 1)
					break;
			}
		}
		e -= 1;
	}
	for (i = 1; i <= n; i++)
		printf("%d ", arr[i]);
	return 0;
}

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