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
#include <bits/stdc++.h>

using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }

  vector<int> counts(n + 1, 0);
  for (int i = 0; i < n; i++) {
    counts[a[i]]++;
  }

  int max_count = 0;
  for (int i = 1; i <= n; i++) {
    max_count = max(max_count, counts[i]);
  }

  if (max_count > n / 2) {
    cout << 1 << endl;
  }
  else {
    int min_subsequences = 0;
    int current_count = 0;
    for (int i = 1; i <= n; i++) {
        current_count += counts[i];
        if (current_count > n / 2) {
            min_subsequences++;
            current_count = 0;
        }
    }

    if (current_count > 0) {
        min_subsequences++;
    }

    cout << min_subsequences << endl;
  }
  return 0;
}