-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTides.java
More file actions
57 lines (52 loc) · 1.42 KB
/
Tides.java
File metadata and controls
57 lines (52 loc) · 1.42 KB
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
import java.io.*;
import java.util.*;
public class Tides
{
public static void main(String[] args) throws IOException
{
BufferedReader b = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(b.readLine());
String[] input = b.readLine().split(" ");
int[] list = new int[n];
for(int i = 0; i<n; i++)
{
list[i] = Integer.parseInt(input[i]);
}
Arrays.sort(list);
if(n%2 == 0)
{
int[] low = new int[n/2];
for(int i = 0; i<n/2; i++)
{
low[i] = list[n/2-i-1];
}
int[] high = new int[n/2];
for(int i = n/2; i<n; i++)
{
high[i-n/2] = list[i];
}
for(int i = 0; i<n/2; i++)
{
System.out.print(low[i]+" "+high[i]+" ");
}
}
else
{
int[] low = new int[n/2+1];
for(int i = 0; i<n/2+1; i++)
{
low[i] = list[n/2-i];
}
int[] high = new int[n/2];
for(int i = n/2+1; i<n; i++)
{
high[i-n/2-1] = list[i];
}
for(int i = 0; i<n/2; i++)
{
System.out.print(low[i]+" "+high[i]+" ");
}
System.out.print(low[low.length-1]);
}
}
}