#include <iostream>
using namespace std;
int main()
{
int i, t, n, k, num[100000];
// N과 K를 입력받는다.
cin >> n >> k;
// 수를 N번 입력받는다.
for(i=0;i<n;i++) cin >> num[i];
// n[i]와 n[i+1]을 비교해서, n[i]가 더 크면 뒤로 보낸다. 이걸 K번 한다.
for(i=0;i<k;i++)
{
if(num[i]>num[i+1])
{
t=num[i];num[i]=num[i+1];num[i+1]=t;
}
}
// 결과를 출력한다.
for(i=0;i<n;i++) cout << num[i] << " ";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1976 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
1980 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
1980 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
1980 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
1980 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
1980 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
1980 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
1984 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
1980 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
1984 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
46 ms |
1976 KB |
Output isn't correct |
2 |
Incorrect |
38 ms |
1980 KB |
Output isn't correct |
3 |
Incorrect |
60 ms |
1984 KB |
Output isn't correct |
4 |
Incorrect |
56 ms |
1980 KB |
Output isn't correct |
5 |
Incorrect |
38 ms |
1984 KB |
Output isn't correct |
6 |
Incorrect |
22 ms |
1984 KB |
Output isn't correct |
7 |
Incorrect |
64 ms |
1984 KB |
Output isn't correct |
8 |
Incorrect |
67 ms |
1980 KB |
Output isn't correct |
9 |
Incorrect |
59 ms |
1984 KB |
Output isn't correct |
10 |
Incorrect |
67 ms |
1984 KB |
Output isn't correct |
11 |
Incorrect |
59 ms |
1984 KB |
Output isn't correct |
12 |
Incorrect |
68 ms |
1980 KB |
Output isn't correct |
13 |
Incorrect |
55 ms |
1984 KB |
Output isn't correct |
14 |
Incorrect |
35 ms |
1984 KB |
Output isn't correct |
15 |
Incorrect |
64 ms |
1984 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
64 ms |
1980 KB |
Output isn't correct |
2 |
Incorrect |
54 ms |
1980 KB |
Output isn't correct |
3 |
Incorrect |
51 ms |
1984 KB |
Output isn't correct |
4 |
Incorrect |
41 ms |
1980 KB |
Output isn't correct |
5 |
Incorrect |
67 ms |
1984 KB |
Output isn't correct |
6 |
Incorrect |
58 ms |
1980 KB |
Output isn't correct |
7 |
Incorrect |
60 ms |
1984 KB |
Output isn't correct |
8 |
Incorrect |
25 ms |
1980 KB |
Output isn't correct |
9 |
Incorrect |
61 ms |
1984 KB |
Output isn't correct |
10 |
Incorrect |
49 ms |
1984 KB |
Output isn't correct |
11 |
Incorrect |
67 ms |
1984 KB |
Output isn't correct |
12 |
Incorrect |
62 ms |
1984 KB |
Output isn't correct |
13 |
Incorrect |
55 ms |
1984 KB |
Output isn't correct |
14 |
Incorrect |
43 ms |
1980 KB |
Output isn't correct |
15 |
Incorrect |
53 ms |
1984 KB |
Output isn't correct |