（二分查找）找一对数

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
 int n[100000];
 for (int i = 0; i < 100000; i++) {
  cin >> n[i];
 }
 int m;
 cin >> m;
 sort(n,n+99999);
 for (int i = 0; i < 100000; i++) {
  int x = m - n[i];
  int mid = 50000;
  int begin = 0, end = 99999;
  while (x != n[mid]&&begin<end) {
   
   if (n[mid] > x) {
    end = mid - 1;
   }
   else {
    begin = mid + 1;
   }
   mid = begin + (end - begin) / 2;
  }
  if (x == n[mid]) {
   cout << n[mid] << "," << n[i] << endl;
   break;
  }
 }

 
 return 0;
}