/
HayBaleStacking.java
29 lines (29 loc) · 1005 Bytes
/
HayBaleStacking.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
import java.util.*;
import java.io.*;
public class HayBaleStacking {
public static void main(String[] args) throws Exception{
Scanner scan = new Scanner(new BufferedReader(new FileReader("stacking.in")));
PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("stacking.out")));
int n = scan.nextInt();
int k = scan.nextInt();
int[] prefixStacks = new int[n + 1];
int[] realStacks = new int[n];
prefixStacks[0] = 0;
for (int i = 0; i < k; i++) {
int start = scan.nextInt();
int end = scan.nextInt();
prefixStacks[start]++;
if (end != n) {
prefixStacks[end+1]--;
}
}
realStacks[0] = prefixStacks[1];
for (int i = 1; i < n; i++) {
realStacks[i] = realStacks[i-1] + prefixStacks[i+1];
}
Arrays.sort(realStacks);
pw.println(realStacks[n/2]);
scan.close();
pw.close();
}
}