Submission #14607

# Submission time Handle Problem Language Result Execution time Memory
14607 2015-05-21T15:35:39 Z caphile98 버블 정렬 (OJUZ10_bubblesort) C++
0 / 100
112 ms 1472 KB
#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;
	int e = n;
	int s = 1;
	for (i = 1; i <= k; i++)
	{
		for (j = s; j < e; j++)
		{
			if (arr[j]>arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
			else
				s += 1;
		}
		e -= 1;
	}
	for (i = 1; i <= n; i++)
		printf("%d ", arr[i]);
	return 0;
}	
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1472 KB Output isn't correct
2 Correct 0 ms 1472 KB Output is correct
3 Correct 0 ms 1472 KB Output is 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
# 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
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
# Verdict Execution time Memory Grader output
1 Incorrect 96 ms 1472 KB Output isn't correct
2 Incorrect 96 ms 1472 KB Output isn't correct
3 Incorrect 77 ms 1472 KB Output isn't correct
4 Incorrect 109 ms 1472 KB Output isn't correct
5 Incorrect 90 ms 1472 KB Output isn't correct
6 Incorrect 64 ms 1472 KB Output isn't correct
7 Incorrect 28 ms 1472 KB Output isn't correct
8 Incorrect 82 ms 1472 KB Output isn't correct
9 Incorrect 108 ms 1472 KB Output isn't correct
10 Incorrect 97 ms 1472 KB Output isn't correct
11 Incorrect 54 ms 1472 KB Output isn't correct
12 Incorrect 67 ms 1472 KB Output isn't correct
13 Incorrect 84 ms 1472 KB Output isn't correct
14 Incorrect 25 ms 1472 KB Output isn't correct
15 Correct 31 ms 1472 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 1472 KB Output isn't correct
2 Incorrect 78 ms 1472 KB Output isn't correct
3 Incorrect 26 ms 1472 KB Output isn't correct
4 Incorrect 77 ms 1472 KB Output isn't correct
5 Incorrect 58 ms 1472 KB Output isn't correct
6 Correct 0 ms 1472 KB Output is correct
7 Incorrect 112 ms 1472 KB Output isn't correct
8 Incorrect 98 ms 1472 KB Output isn't correct
9 Incorrect 49 ms 1472 KB Output isn't correct
10 Incorrect 102 ms 1472 KB Output isn't correct
11 Incorrect 111 ms 1472 KB Output isn't correct
12 Incorrect 95 ms 1472 KB Output isn't correct
13 Incorrect 101 ms 1472 KB Output isn't correct
14 Incorrect 100 ms 1472 KB Output isn't correct
15 Incorrect 90 ms 1472 KB Output isn't correct