Greedy algorithms make the locally optimal choice at each step. You need to prove (or develop strong intuition) that local optimum leads to global optimum. This justification is the hardest part of greedy problems.
Unlike DP which considers all possibilities, greedy commits to choices without backtracking. Sorting often enables the greedy choice by ordering elements so the best local choice is obvious at each step.