C++ ✅✅ Easy LOWER BOUND 2023 short sol MUST WATCH.
\nclass Solution {\npublic:\n    vector<int> successfulPairs(vector<int>& s, vector<int>& p, long long t) {\n        sort(p.begin(),p.end());\n        vector<in
```\nclass Solution {\npublic:\n    vector<int> successfulPairs(vector<int>& s, vector<int>& p, long long t) {\n        sort(p.begin(),p.end());\n        vector<int> ans; \n        int x; long long y;\n        for(auto &it:s) {\n            y = t / it;\n            x = p.end() - lower_bound(p.begin(),p.end(),y * it >= t ? y : y + 1);\n            ans.push_back(x);\n        }\n        return ans;\n    }\n};\n```
['C', 'Sorting', 'Binary Tree']