When is greedy correct vs when you need dynamic programming?

// Greedy activity selection (by finish time) — O(n log n)
activities.sort(Comparator.comparingInt(a -> a.end));
int count = 0, lastEnd = 0;
for (Activity a : activities) {
  if (a.start >= lastEnd) { count++; lastEnd = a.end; }
}