#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 t = n;
for (i = 1; i <= k; i++)
{
for (j = 1; j < t; j++)
{
if (arr[j]>arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
t -= 1;
}
for (i = 1; i <= n; i++)
printf("%d ", arr[i]);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1472 KB |
Output is correct |
2 |
Correct |
0 ms |
1472 KB |
Output is correct |
3 |
Correct |
0 ms |
1472 KB |
Output is correct |
4 |
Correct |
0 ms |
1472 KB |
Output is correct |
5 |
Correct |
0 ms |
1472 KB |
Output is correct |
6 |
Correct |
0 ms |
1472 KB |
Output is correct |
7 |
Correct |
0 ms |
1472 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1472 KB |
Output is correct |
2 |
Correct |
2 ms |
1472 KB |
Output is correct |
3 |
Correct |
0 ms |
1472 KB |
Output is correct |
4 |
Correct |
5 ms |
1472 KB |
Output is correct |
5 |
Correct |
3 ms |
1472 KB |
Output is correct |
6 |
Correct |
0 ms |
1472 KB |
Output is correct |
7 |
Correct |
0 ms |
1472 KB |
Output is correct |
8 |
Correct |
3 ms |
1472 KB |
Output is correct |
9 |
Correct |
0 ms |
1472 KB |
Output is correct |
10 |
Correct |
0 ms |
1472 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
2 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
3 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
4 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
5 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
6 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
7 |
Correct |
114 ms |
1472 KB |
Output is correct |
8 |
Correct |
34 ms |
1472 KB |
Output is correct |
9 |
Correct |
112 ms |
1472 KB |
Output is correct |
10 |
Correct |
46 ms |
1472 KB |
Output is correct |
11 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
12 |
Correct |
240 ms |
1472 KB |
Output is correct |
13 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
14 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
15 |
Correct |
27 ms |
1472 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
2 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
3 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
4 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
5 |
Correct |
64 ms |
1472 KB |
Output is correct |
6 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
7 |
Correct |
32 ms |
1472 KB |
Output is correct |
8 |
Correct |
110 ms |
1472 KB |
Output is correct |
9 |
Correct |
238 ms |
1472 KB |
Output is correct |
10 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
11 |
Correct |
122 ms |
1472 KB |
Output is correct |
12 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
13 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
14 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
15 |
Correct |
34 ms |
1472 KB |
Output is correct |