store/works/solutions/acwing/1238.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

#include <iostream>
#include <map>
#include <set>

const int M = 100010;

int N, D, K;

std::map<int, std::multiset<int>> vote_map;

bool check(const std::multiset<int> &v) {
  auto iter1 = v.cbegin();
  auto iter2 = v.cbegin();

  const auto end = v.cend();

  int count = 1;

  while (iter2 != end) {
    while (*iter2 - *iter1 >= D) {
      ++iter1;
      count--;
    }

    if (count >= K)
      return true;

    ++iter2;
    count++;
  }

  return false;
}

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  std::cin >> N >> D >> K;

  for (int i = 1; i <= N; i++) {
    int ts, id;
    std::cin >> ts >> id;
    vote_map[id].insert(ts);
  }

  int result;

  for (const auto &vote : vote_map) {
    if (check(vote.second)) {
      std::cout << vote.first << "\n";
    }
  }

  return 0;
}