-
Notifications
You must be signed in to change notification settings - Fork 1
/
CoveringSegments.java
39 lines (34 loc) · 1.07 KB
/
CoveringSegments.java
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
import java.util.*;
public class CoveringSegments {
private static int[] optimalPoints(Segment[] segments) {
int[] points = new int[2 * segments.length];
for (int i = 0; i < segments.length; i++) {
points[2 * i] = segments[i].start;
points[2 * i + 1] = segments[i].end;
}
return points;
}
private static class Segment {
int start, end;
Segment(int start, int end) {
this.start = start;
this.end = end;
}
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Segment[] segments = new Segment[n];
for (int i = 0; i < n; i++) {
int start, end;
start = scanner.nextInt();
end = scanner.nextInt();
segments[i] = new Segment(start, end);
}
int[] points = optimalPoints(segments);
System.out.println(points.length);
for (int point : points) {
System.out.print(point + " ");
}
}
}