sum of 2 numbers problem

I need help creating a O(n log n) algorithm that determines whether or not there exists two elements in S whose sum is exactly z.  Additionally, the problem indicates that sorting is somehow related to the solution.