#include<stdio.h>
int a[100010];
int main() {
int n,k,i,j,t;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
for(i=1;i<=k;i++){
for(j=1;j<=n-i;j++){
if(a[j]>a[j+1]){
t=a[j];a[j]=a[j+1];a[j+1]=t;
}
}
}
for(i=1;i<=n;i++)printf("%d ",a[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 |
0 ms |
1472 KB |
Output is correct |
3 |
Correct |
2 ms |
1472 KB |
Output is correct |
4 |
Correct |
3 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 |
5 ms |
1472 KB |
Output is correct |
8 |
Correct |
0 ms |
1472 KB |
Output is correct |
9 |
Correct |
4 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 |
Correct |
43 ms |
1472 KB |
Output is correct |
3 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
4 |
Correct |
35 ms |
1472 KB |
Output is correct |
5 |
Correct |
108 ms |
1472 KB |
Output is correct |
6 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
7 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
8 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
9 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
10 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
11 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
12 |
Correct |
246 ms |
1472 KB |
Output is correct |
13 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
14 |
Correct |
121 ms |
1472 KB |
Output is correct |
15 |
Correct |
47 ms |
1472 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
2 |
Correct |
53 ms |
1472 KB |
Output is correct |
3 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
4 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
5 |
Correct |
239 ms |
1472 KB |
Output is correct |
6 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
7 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
8 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
9 |
Correct |
35 ms |
1472 KB |
Output is correct |
10 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
11 |
Correct |
29 ms |
1472 KB |
Output is correct |
12 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
13 |
Correct |
112 ms |
1472 KB |
Output is correct |
14 |
Execution timed out |
1000 ms |
1468 KB |
Program timed out |
15 |
Correct |
115 ms |
1472 KB |
Output is correct |