大佬求解

#include<iostream>
#include<algorithm>
#include<iterator>
using namespace std;
void change(int *arr, int n){
    int max=*max_element(arr,arr+n);
    for(int i=0;i<n;i++)
     if(max==arr[i]){
        arr[i]=arr[0];
        arr[0]=max;
        break;
    }
}
int main() {
    int n[]={1,4,22,3,8,35};
    change(n, 6);
    copy(n,n+6,ostream_iterator<int>(cout,","));
    return 0;  
}

#include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;

void change_maxvalue_to_top( int* arr, size_t n ) // 按照C++风格，这里参数列表应该是( int* first, int* last )
{
    if( n != 0 )
        iter_swap( arr, max_element(arr,next(arr,n)) );
}

int main( void )
{
    int arr[] = { 1, 4, 22, 3, 8, 35 };
    change_maxvalue_to_top( arr, size(arr) );

    copy( begin(arr), end(arr), ostream_iterator<decltype(*arr)>(cout,", ") );
}