T5 - zad.6.

#include <iostream>
#include<algorithm>

int main()
{
    std::cout<<"Unesi broj clanova niza: ";
    int n, niz[100];
    std::cin>>n;
    std::cout<<"Unesi niz:"<<std::endl;

    for(int i=0; i<n; i++)
        std::cin>> niz[i];

    int a;
    std::cout<<"Unesite broj: ";
    std::cin>>a;

    std::sort(std::begin(niz), std::begin(niz)+n);

    int *p(std::find(std::begin(niz), std::begin(niz)+n,a));

    if(std::binary_search(std::begin(niz), std::begin(niz)+n, a))
    {
        std::cout<<std::endl<<"Mjesto u nizu: "
   <<1+std::count_if(std::begin(niz), p, [](int x) {if(x>0) return true; else return false;});
    }

    else
        std::cout<<std::endl<<"Nema ga u nizu!";






return 0;
}