class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> ans;
        vector<int>sorted=nums;
        sort(sorted.begin(),sorted.end());
        for(int i=0;i<nums.size();i++){
            if(lower_bound(sorted.begin(),sorted.end(),target-nums[i])-upper_bound(sorted.begin(),sorted.end(),7)==-1){
                ans.push_back(find(nums.begin(),nums.end(),nums[i])-nums.begin());
                ans.push_back(find(nums.begin(),nums.end(),target-nums[i])-nums.begin());
            }
        }
        // cout<<lower_bound(sorted.begin(),sorted.end(),7)-upper_bound(sorted.begin(),sorted.end(),7);
        return ans;
    }
};