#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5]={1,2,3,0,-20};
cout<<*max_element(a,a+5)<<endl;
cout<<*max_element(a,a+5)<<endl;
return 0;
}

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5]={1,2,3,0,-2},m=10;
*min_element(a,a+5) += *max_element(a,a+5);//把最小元素和最大元素的和 賦給當前最小元素
cout<<*max_element(a,a+5);
return 0;
}

eg:custom2<pre style="margin-top: 0px; margin-bottom: 0px; color: rgb(0, 128, 0);">template <class T, class Compare>
? const T& min (const T& a, const T& b, Compare comp);

#include<iostream>
#include<algorithm>
using namespace std;
struct var {
?? ?char *name;
?? ?int key;
?? ?var(char *a,int k):name(a),key(k){}
};
bool comp(const var& l, const var& r) {
?? ?return l.key < r.key;
}
int main() {
?? ?var v1("var1", 2);
?? ?var v2("var2", 3);
?? ?cout << std::min(v1, v2,comp).name << endl;
?? ?return 0;
}