Tuesday, 7 March 2017

Geeksforgeeks Solution For " Smaller and Larger "

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

Problem :- Given a sorted array and a value x, find the number of array elements less than or equal to x and elements more than or equal to x. 

Submit Your Solution :- Click Here 


Solution :-

#include <iostream>
#include <vector>
using namespace std;
int main() 
{
int t1;
cin>>t1;
while(t1--)
{
  int n,x,i,count=0,temp=0;
  cin>>n>>x;
  vector <int> arr(n);
  
  for(i=0;i<n;i++)
   cin>>arr[i];
   
   for(i=0;i<n;i++)
   {
       if(arr[i]<=x)
       temp++;
       else if(arr[i]>=x)
       count++;
   }
   cout<<temp<<" "<<count<<endl;
}    

return 0;
}

Output:-

Geeksforgeeks Solution For " Smaller and Larger "

No comments:
Write comments

Recommended Posts × +