Binary Search (std::binary_search)

Medium STL Algorithms

Solve in Playground →

Problem Statement

Write a C++ program using `std::binary_search` to check if a target exists in a sorted vector.

Input Format

First line: N and Target. Second line: N sorted integers.

Output Format

Print 'Present' or 'Absent'.

Constraints

1 <= N <= 1000

Sample Input

5 30
10 20 30 40 50

Sample Output

Present

Explanation

Binary search operates in $O(log N)$ time complexity on sorted ranges.

Starter Code

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int n, target;
    if (std::cin >> n >> target) {
        std::vector<int> vec(n);
        for (int i = 0; i < n; i++) std::cin >> vec[i];
        
        // Write your std::binary_search logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →