#include<stdio.h>
#include<algorithm>
using namespace std;
int a[100010],visit[100010];
struct data{
int num,g;
}b[100010];
int cmp(const data&p,const data&q){return p.g<q.g;}
int main() {
int n,k,i,j;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++){scanf("%d",&a[i]);b[i].g=a[i];b[i].num=i;}
sort(b+1,b+n+1,cmp);
for(i=n;i>n-k;i--)visit[b[i].num]=1;
for(i=1;i<=n;i++)if(visit[i]==0)printf("%d ",a[i]);
for(i=n-k+1;i<=n;i++)printf("%d ",b[i].g);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
5 |
Correct |
0 ms |
2644 KB |
Output is correct |
6 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
2644 KB |
Output isn't correct |
10 |
Correct |
0 ms |
2644 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
50 ms |
2644 KB |
Output isn't correct |
2 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
3 |
Incorrect |
15 ms |
2644 KB |
Output isn't correct |
4 |
Incorrect |
41 ms |
2644 KB |
Output isn't correct |
5 |
Incorrect |
40 ms |
2644 KB |
Output isn't correct |
6 |
Incorrect |
47 ms |
2644 KB |
Output isn't correct |
7 |
Incorrect |
37 ms |
2644 KB |
Output isn't correct |
8 |
Incorrect |
53 ms |
2644 KB |
Output isn't correct |
9 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
10 |
Incorrect |
44 ms |
2644 KB |
Output isn't correct |
11 |
Incorrect |
36 ms |
2644 KB |
Output isn't correct |
12 |
Incorrect |
40 ms |
2644 KB |
Output isn't correct |
13 |
Correct |
38 ms |
2644 KB |
Output is correct |
14 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
15 |
Incorrect |
33 ms |
2644 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
55 ms |
2644 KB |
Output isn't correct |
2 |
Incorrect |
14 ms |
2644 KB |
Output isn't correct |
3 |
Incorrect |
37 ms |
2644 KB |
Output isn't correct |
4 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
5 |
Incorrect |
35 ms |
2644 KB |
Output isn't correct |
6 |
Correct |
39 ms |
2644 KB |
Output is correct |
7 |
Incorrect |
25 ms |
2644 KB |
Output isn't correct |
8 |
Incorrect |
44 ms |
2644 KB |
Output isn't correct |
9 |
Incorrect |
37 ms |
2644 KB |
Output isn't correct |
10 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
11 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
12 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
13 |
Incorrect |
38 ms |
2644 KB |
Output isn't correct |
14 |
Incorrect |
33 ms |
2644 KB |
Output isn't correct |
15 |
Incorrect |
31 ms |
2644 KB |
Output isn't correct |