# find and display v in lowest 20th percentile : find « STL Algorithms Non modifying sequence operations « C++

find and display v in lowest 20th percentile

```
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>

using namespace std;

int main( )
{
const int a[] = { 8, 7, 4, 9, 5, 2, 6, 2, 7,9, };
const int len = sizeof( a ) / sizeof( a[0] );

const int percentile_20 = static_cast<int>( 0.2 * len );
vector<int> v( a, a+len );

nth_element( v.begin(), v.begin()+percentile_20-1,v.end() );

copy( v.begin(), v.begin() + percentile_20,ostream_iterator<int>( cout, " " ) );

}

```

### Related examples in the same category

 1 Use find to search an element in a container 2 find an element in a list 3 Find the maximum element in a range in a list 4 Locate first occurrence of a value in a vector 5 Using find with normal iteration 6 Demonstrating generic find algorithm with an array 7 Generic find algorithm: use find function to find an element in an array 8 Use find algorithm to find an element in a list 9 Use istream_iterator and find 10 Generic find algorithm with input iterators associated with io streams 11 Use assert to check the find method 12 find and display v in highest 20th percentile 13 find and display sorted v in lowest 20th percentile 14 find and display sorted v in highest 20th percentile