/
anuund.cpp
83 lines (66 loc) · 1.46 KB
/
anuund.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <stdio.h>
int main()
{
int N,i,ltop,gtop,cases,max,min;
bool pl;
scanf("%d",&cases);
while(cases--)
{
scanf("%d",&N);
int arr[N];
max=0;
min=1000000010;
for(i=0;i<N;i++)
{
scanf("%d",&arr[i]);
if(arr[i]>max)
{
max=arr[i];
}
if(arr[i]<min)
{
min=arr[i];
}
}
int greater[N];
int less[N];
ltop=-1;
gtop=-1;
pl=true;
max=(max+min)/2;
for(i=0;i<N;i++)
{
if(pl)
{
if(arr[i]<=max)
{
printf("%d", arr[i]);
if(gtop!=-1)
{
printf("%d", greater[gtop--]);
}else
{
pl=false;
}
}else
greater[++gtop]=arr[i];
}else
{
if(arr[i]>max)
{
printf("%d", arr[i]);
if(ltop!=-1)
{
printf("%d", less[ltop--]);
}else
{
pl=true;
}
}else
less[++ltop]=arr[i];
}
}
printf("\n");
}
return 0;
}