LeetCode Two Sum

// 20ms
 1 struct Node
{
     int num;
     int pos;
};
bool cmp(const Node &a,const Node &b)
{
    return a.num<b.num;
}
class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<Node> v;
        Node node;
        vector<int>::iterator p;
        vector<int> re;
        int i=1,j;
        for(p=numbers.begin();p!=numbers.end();p++)
        {
            node.pos=i;
            i++;
            node.num=*p;
            v.push_back(node);
        }
        sort(v.begin(),v.end(),cmp);
        i=0;
        j=v.size()-1;
        while(1)
        {
            if(v[i].num+v[j].num==target)
            {
                break;
            }
            else if(v[i].num+v[j].num<target)
            {
                i++;
            }
            else 
            {
                j--;
            }
        }
        re.push_back(v[i].pos);
        re.push_back(v[j].pos);
        sort(re.begin(),re.end());
        return re;
    }
};