C++ · Solution

Count Number of Pairs

This C++ solution uses binary search for Count Number of Pairs. Read the reasoning, inspect the code, or try your own test case below.

Sorting & searchingBinary searchC++23 lines
Solution058of 248
Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Binary search

Count Number of Pairs: use the monotonic structure of the search space to discard half of the remaining candidates at each step.

Monotonic search

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

View exact source file ↗
Implementation

count_number_of_pairs.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n, m;
        cin >> n >> m;
        vector<int>v(n);
        for(int i = 0; i < n; i++){
            cin >> v[i];
        }
        sort(v.begin(), v.end());
        long long ans = 0;
        for(int i = 0; i < v.size(); i++){
            int x = v[i], y = m - v[i];
            int cnt = upper_bound(v.begin() + i + 1, v.end(), y) - (v.begin() + i + 1);
            ans += cnt;
        }
        cout << ans << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.