Pair with Given Sum

Easy Algorithmic Challenges

Solve in Playground →

Problem Statement

Write a C program to check if there exists a pair of elements in a sorted array that sums up to a given target.

Input Format

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

Output Format

Print 'Yes' if such a pair exists, otherwise 'No'.

Constraints

2 <= N <= 1000

Sample Input

5 10
1 2 3 7 8

Sample Output

Yes

Explanation

2 + 8 = 10, so a valid pair exists.

Starter Code

#include <stdio.h>

int main() {
    int n, target;
    if (scanf("%d %d", &n, &target) == 2) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →