void sort(int* arr, int n)
{
int max = arr[0];
int next_max = arr[1];
for (int i = 1; i < n; i++)
{
if (arr[i] > max)
{
next_max = max;
max = arr[i];
}
else if (arr[i] > next_max)
{
next_max = arr[i];
}
}
cout << "max:" << max << endl;
cout << "next_max:" << next_max << endl;
return;
}
int main()
{
int arr[] = { 13, 46, 2, 5, 74, 64, 54, 3, 4, 36 };
sort(arr, sizeof(arr) / sizeof(arr[0]));
return 0;
}