#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int &a,int &b)
{
return a>b;
}
int main (void)
{
int iArray[] = {1, 15, -235, 0, 15, 2348, -2345, 999};
for (size_t i = 0;i < sizeof (iArray) / sizeof (*iArray);i++)
{
cout << iArray[i] <<' ';
}
cout << endl;
partial_sort(iArray, iArray + 5, iArray + sizeof (iArray) / sizeof (*iArray),cmp);
for (size_t i = 0;i < sizeof (iArray) / sizeof (*iArray);i++)
{
cout << iArray[i] <<' ';
}
cout << endl;
return 0;
}
partial_sort的用法
最新推荐文章于 2024-01-28 23:06:23 发布