*max_element(a.begin(), a.end());
auto max = *max_element(vector.begin(), vector.end());
cout<<*max_element(a.begin(), a.end())<<endl;
// C++ program to find the min and max element
// of Vector using *min_element() in STL
#include <bits/stdc++.h>
using namespace std;
int main()
{
// Get the vector
vector<int> a = { 1, 45, 54, 71, 76, 12 };
// Print the vector
cout << "Vector: ";
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
// Find the min element
cout << "
Min Element = "
<< *min_element(a.begin(), a.end());
// Find the max element
cout << "
Max Element = "
<< *max_element(a.begin(), a.end());
return 0;
}
#include <iostream>
#include <algorithm>
template <typename T, size_t N> const T* mybegin(const T (&a)[N]) { return a; }
template <typename T, size_t N> const T* myend (const T (&a)[N]) { return a+N; }
int main()
{
const int cloud[] = { 1,2,3,4,-7,999,5,6 };
std::cout << *std::max_element(mybegin(cloud), myend(cloud)) << '
';
std::cout << *std::min_element(mybegin(cloud), myend(cloud)) << '
';
}
template <typename T, size_t N> const T* mybegin(const T (&a)[N]) { return a; }
template <typename T, size_t N> const T* myend (const T (&a)[N]) { return a+N; }
auto it = max_element(std::begin(cloud), std::end(cloud)); // c++11