twoSum

class Solution {
public:
    struct pos {
        int val;
        int idx;
        bool operator < ( const struct pos & lhs) const{
            return val < lhs.val;
        }
        pos(int v, int x) {
            val = v;
            idx = x;
        }
    };
    vector<int> twoSum(vector<int> &numbers, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> index;
        vector<pos> pt;
        for (int i = 0; i < numbers.size(); ++i) {
            pt.push_back(pos(numbers.at(i), i));
        }
        std::sort(pt.begin(), pt.end());
        for (int i = 0; i < pt.size(); ++i) {
            int key = target - pt.at(i).val;
            int res_index = binarySearch(pt, i + 1,  key);
            if (res_index != -1) {
                index.push_back(pt.at(i).idx + 1);
                index.push_back(res_index + 1);
                if (index.at(0) > index.at(1)) {
                    swap(index.at(0), index.at(1));
                }
                break;
            }
        }
        return index;
    }
    int binarySearch(vector<pos> &numbers, int beg, int key) {
        int low = beg; 
        int high = numbers.size() - 1;
        int mid;
        while (low <= high) {
            mid = (low + high) >> 1;
            if (numbers.at(mid).val == key) 
                return numbers.at(mid).idx;
            else if (numbers.at(mid).val > key) {
                high = mid - 1;
            }
            else {
                low = mid + 1;
            }
        }
        return -1;
    } 
};