#include<cstdio>
#include<algorithm>
#include<map>
int a,b,i,j,t,p,q,m,n,s,x[160001],y[160001];
std::map<int,int>D,U;
main()
{
scanf("%d%d",&a,&b);
for(i=0;i<a;i++)
{
scanf("%d",&x[i]);
y[i]=x[i];
U[x[i]]++;
}
std::sort(y,y+a);
for(i=a-b;i<a;i++)
{
D[y[i]]++;
}
for(i=0;i<a;i++)
{
if(D[x[i]]!=U[x[i]])
{
printf("%d ",x[i]);
D[x[i]]++;
}
}
for(i=a-b;i<a;i++)
{
printf("%d ",y[i]);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
2 |
Correct |
0 ms |
2464 KB |
Output is correct |
3 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2596 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
2596 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
7 |
Correct |
0 ms |
2464 KB |
Output is correct |
8 |
Incorrect |
0 ms |
2596 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
2464 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
205 ms |
11836 KB |
Output isn't correct |
2 |
Incorrect |
200 ms |
11836 KB |
Output isn't correct |
3 |
Incorrect |
200 ms |
11836 KB |
Output isn't correct |
4 |
Incorrect |
136 ms |
9856 KB |
Output isn't correct |
5 |
Incorrect |
197 ms |
11836 KB |
Output isn't correct |
6 |
Incorrect |
184 ms |
10648 KB |
Output isn't correct |
7 |
Incorrect |
125 ms |
8932 KB |
Output isn't correct |
8 |
Correct |
234 ms |
11836 KB |
Output is correct |
9 |
Incorrect |
190 ms |
11836 KB |
Output isn't correct |
10 |
Incorrect |
68 ms |
6028 KB |
Output isn't correct |
11 |
Incorrect |
203 ms |
11836 KB |
Output isn't correct |
12 |
Incorrect |
226 ms |
11836 KB |
Output isn't correct |
13 |
Incorrect |
193 ms |
11836 KB |
Output isn't correct |
14 |
Incorrect |
228 ms |
11836 KB |
Output isn't correct |
15 |
Incorrect |
214 ms |
11836 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
177 ms |
8404 KB |
Output isn't correct |
2 |
Incorrect |
171 ms |
8272 KB |
Output isn't correct |
3 |
Incorrect |
170 ms |
8272 KB |
Output isn't correct |
4 |
Incorrect |
187 ms |
8272 KB |
Output isn't correct |
5 |
Incorrect |
114 ms |
6556 KB |
Output isn't correct |
6 |
Incorrect |
191 ms |
8272 KB |
Output isn't correct |
7 |
Incorrect |
171 ms |
8272 KB |
Output isn't correct |
8 |
Incorrect |
180 ms |
8272 KB |
Output isn't correct |
9 |
Incorrect |
146 ms |
7084 KB |
Output isn't correct |
10 |
Incorrect |
163 ms |
8272 KB |
Output isn't correct |
11 |
Incorrect |
183 ms |
8404 KB |
Output isn't correct |
12 |
Incorrect |
164 ms |
7612 KB |
Output isn't correct |
13 |
Correct |
200 ms |
8272 KB |
Output is correct |
14 |
Incorrect |
56 ms |
4708 KB |
Output isn't correct |
15 |
Incorrect |
173 ms |
8272 KB |
Output isn't correct |