运用归并排序，在用二分法查找，算法复杂度：nlogn，n个数两两相加，若能等于特定数m，则输出yes，否则输出no.-Use merge sort, in a binary search algorithm complexity: nlogn, n number two together, if can equal to a specific number m, the output yes, otherwise no output.