Two Sum

struct node
{
    int n;
    int value;
};
bool cmp(node a,node b)
{
    return a.value<b.value;
}
class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target)
    {
        vector<node> a;
        vector<int> result;
        for(int i=0;i<numbers.size();i++)
        {
            a.push_back(node{i+1,numbers[i]});
        }
        sort(a.begin(),a.end(),cmp);

        for(int i=0;i<a.size();i++)
        {
            int l=0,r=numbers.size();
            int key=target-a[i].value;
            while(l<r)
            {
                int m=l+(r-l+1)/2;
                if(a[m].value==key&&m!=i)
                {
                    result.push_back(a[i].n);
                    result.push_back(a[m].n);
                    sort(result.begin(),result.end());
                    return result;
                }
                if(a[m].value<key)
                    l=m;
                if(a[m].value>key)
                    r=m-1;
            }
        }
    }
};