Describe a O(n lgn) - time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x.

• 因为无聊；准备细细再琢磨一番；上面是第二章一超级入门题目；愣是不会做.