Array Lookup test cases failing - c++

Question

So, this is one of two practice questions given by our professor on HackerRank. I came up with the code but the solution only passes 2/5 test cases. I tried thinking about the possible test cases that give an error for around 4 hours, but, I could not wrap my mind around it.
Can someone point out where I went wrong?
Below is the question.
Alice went for shopping and bought 8 goods costing different prices.
At the time of billing she realises that she did not have enough
money. Now, she have decided to remove the item costing maximum amount
and replace it with another item whose price is same as the item
costing minimum amount. Help Alice and display final prices on the
screen.
Note: if more than one element cost maximum price, replace the first
item.
Example 1:
Input: 250 1000 50 20 10 100 200 25
Output: 250 10 50 20 10 100 200 25
Example 2:
Input: 2500 2500 50 20 10 100 200 25
Output: 10 2500 50 20 10 100 200 25
Sample Input: 250 1000 50 20 10 100 200 25
Sample Output: 10 2500 50 20 10 100 200 25
Constraints
8 items prices are required
Output Format
Prints the final prices of different items after replacing
MY CODE:
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int arr[8];
int check=0;
int max=0,min=0;
for(int i=0;i<8;i++)
{
cin>>arr[i];
if(i==0)
{
max =arr[0];
min =arr[0];
}
else
if(arr[i]>max)
max = arr[i];
if(arr[i]<min)
min = arr[i];
}
for(int i=0;i<8;i++)
{
if(arr[i]==max && check==0)
{
arr[i]=min;
check++;
}
cout<<arr[i]<<" ";
}
}