#include <stdio.h>
#define MAX 100001
int arr[MAX];
int brr[MAX];
int check[MAX];
int main()
{
int n, k;
scanf("%d%d", &n, &k);
int i, j;
for (i = 1; i <= n; i++)
{
scanf("%d", &arr[i]);
brr[i] = arr[i];
}
int temp;
int a = 0;
int e = n;
int l;
for (i = 1; i <= k; i++)
{
for (j = 1; j < e; j++)
{
if (check[j] == 1 || check[j + 1] == 1)
continue;
if (arr[j]>arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
for (j = 1; j <= e; j++)
{
if (check[j] == 1)
continue;
if (arr[j] == brr[j])
{
check[j] = 1;
a += 1;
if (a == n)
{
for (l = 1; l <= n; l++)
printf("%d ", arr[l]);
return 0;
}
}
brr[j] = arr[j];
}
e -= 1;
}
for (i = 1; i <= n; i++)
printf("%d ", arr[i]);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 3 |
Correct |
0 ms |
2256 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2256 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
2256 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 4 |
Incorrect |
3 ms |
2256 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 7 |
Incorrect |
4 ms |
2256 KB |
Output isn't correct |
| 8 |
Incorrect |
5 ms |
2256 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
2256 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
107 ms |
2256 KB |
Output isn't correct |
| 2 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 3 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 4 |
Correct |
0 ms |
2256 KB |
Output is correct |
| 5 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 6 |
Incorrect |
64 ms |
2256 KB |
Output isn't correct |
| 7 |
Incorrect |
267 ms |
2256 KB |
Output isn't correct |
| 8 |
Incorrect |
31 ms |
2256 KB |
Output isn't correct |
| 9 |
Incorrect |
159 ms |
2256 KB |
Output isn't correct |
| 10 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 11 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 12 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 13 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 14 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 15 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 2 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 3 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 4 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 5 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 6 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 7 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 8 |
Incorrect |
70 ms |
2256 KB |
Output isn't correct |
| 9 |
Incorrect |
156 ms |
2256 KB |
Output isn't correct |
| 10 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
| 11 |
Incorrect |
31 ms |
2256 KB |
Output isn't correct |
| 12 |
Incorrect |
105 ms |
2256 KB |
Output isn't correct |
| 13 |
Incorrect |
254 ms |
2256 KB |
Output isn't correct |
| 14 |
Correct |
22 ms |
2256 KB |
Output is correct |
| 15 |
Execution timed out |
1000 ms |
2252 KB |
Program timed out |
