Thursday, 6 April 2017

Geeksforgeeks Solution For " Floor in a Sorted Array "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Floor in a Sorted Array

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int i,j=0,n,x;
        cin>>n>>x;
        vector<int> arr(n);
        
        for(i=0;i<n;i++)
        cin>>arr[i];
        sort(arr.begin(),arr.end());
        for(i=0;i<n;i++)
        {
            if(arr[i]<=x)
            j++;
        }
        if(j!=0)
        cout<<j-1<<endl;
        else
        cout<<"-1"<<endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Floor in a Sorted Array "

No comments:
Write comments

Recommended Posts × +