用法一(查找下界)
在对元素类型为 T 的从小到大排好序的基本数据类型中进行查找
T * lower_bound(数组名 + n1 , 数组名 + n2 , 值);
返回一个指针 T * p;
*p...NUM] = { 12,5,3,5,98,21,7 };
sort(a, a + NUM);
Print(a, NUM); // 结果: 3,5,5,7,12,21,98
int* p1 = lower_bound...(a, a + NUM, 16, Rule1()) << endl; // 结果 : 7 (输出元素值)
cout << lower_bound(a, a + NUM, 25, Rule1())...(a, a + NUM, 16, Rule1()) << endl; // 结果 : 7 (输出元素值)
cout << lower_bound(a, a + NUM, 25, Rule1())...(a, a + NUM, 16, Rule1()) << endl; // 结果 : 7 (输出元素值)
cout << lower_bound(a, a + NUM, 25, Rule1())