Submission #14605

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
14605	2015-05-21T15:28:31 Z	caphile98	버블 정렬 (OJUZ10_bubblesort)	C++	0 / 100	44 ms	1472 KB

bubblesort

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

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;
	for (i = 1; i <= k; i++)
	{
		for (j = 1; j < n; j++)
		{
			if (arr[j]>arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
			else
				break;
		}
	}
	for (i = 1; i <= n; i++)
		printf("%d ", arr[i]);
	return 0;
}	

Subtask #1

0.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	1472 KB	Output isn't correct
2	Incorrect	0 ms	1472 KB	Output isn't correct
3	Incorrect	0 ms	1472 KB	Output isn't correct
4	Incorrect	0 ms	1472 KB	Output isn't correct
5	Incorrect	0 ms	1472 KB	Output isn't correct
6	Incorrect	0 ms	1472 KB	Output isn't correct
7	Incorrect	0 ms	1472 KB	Output isn't correct

Subtask #2

0.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	1472 KB	Output isn't correct
2	Incorrect	1 ms	1472 KB	Output isn't correct
3	Incorrect	0 ms	1472 KB	Output isn't correct
4	Incorrect	0 ms	1472 KB	Output isn't correct
5	Incorrect	0 ms	1472 KB	Output isn't correct
6	Incorrect	0 ms	1472 KB	Output isn't correct
7	Incorrect	0 ms	1472 KB	Output isn't correct
8	Incorrect	0 ms	1472 KB	Output isn't correct
9	Incorrect	0 ms	1472 KB	Output isn't correct
10	Incorrect	0 ms	1472 KB	Output isn't correct

Subtask #3

0.0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	24 ms	1472 KB	Output isn't correct
2	Incorrect	33 ms	1472 KB	Output isn't correct
3	Incorrect	29 ms	1472 KB	Output isn't correct
4	Incorrect	0 ms	1472 KB	Output isn't correct
5	Incorrect	19 ms	1472 KB	Output isn't correct
6	Incorrect	0 ms	1472 KB	Output isn't correct
7	Incorrect	18 ms	1472 KB	Output isn't correct
8	Incorrect	0 ms	1472 KB	Output isn't correct
9	Incorrect	18 ms	1472 KB	Output isn't correct
10	Incorrect	0 ms	1472 KB	Output isn't correct
11	Incorrect	14 ms	1472 KB	Output isn't correct
12	Incorrect	41 ms	1472 KB	Output isn't correct
13	Incorrect	14 ms	1472 KB	Output isn't correct
14	Incorrect	12 ms	1472 KB	Output isn't correct
15	Incorrect	40 ms	1472 KB	Output isn't correct

Subtask #4

0.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	25 ms	1472 KB	Output isn't correct
2	Incorrect	0 ms	1472 KB	Output isn't correct
3	Incorrect	44 ms	1472 KB	Output isn't correct
4	Incorrect	0 ms	1472 KB	Output isn't correct
5	Incorrect	0 ms	1472 KB	Output isn't correct
6	Incorrect	33 ms	1472 KB	Output isn't correct
7	Incorrect	24 ms	1472 KB	Output isn't correct
8	Incorrect	22 ms	1472 KB	Output isn't correct
9	Incorrect	23 ms	1472 KB	Output isn't correct
10	Incorrect	30 ms	1472 KB	Output isn't correct
11	Incorrect	33 ms	1472 KB	Output isn't correct
12	Incorrect	43 ms	1472 KB	Output isn't correct
13	Incorrect	30 ms	1472 KB	Output isn't correct
14	Incorrect	22 ms	1472 KB	Output isn't correct
15	Incorrect	20 ms	1472 KB	Output isn't correct