백준 2751 c++

#include <iostream>
#include <algorithm>

using namespace std;

int input(int lower, int upper);
void int_array_input_no_repetition(int* array, int size);
void print_array(int* array, int size);

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N;
	int* arr;

	N = input(1, 1000000);
	arr = new int[N];
	int_array_input_no_repetition(arr, N);
	sort(arr, arr + N);
	print_array(arr, N);

	delete[] arr;

	return 0;
}

int input(int lower, int upper)
{
	int A;

	while (1)
	{
		scanf("%d", &A);
		//cin >> A;
		if (A >= lower && A <= upper)
		{
			break;
		}
		else
		{
			;
		}
	}

	return A;
}

void int_array_input_no_repetition(int* array, int size)
{
	int i, j;

	for (i = 0; i < size; i++)
	{
		array[i] = input(-1000000, 1000000);
		/*for (j = 0; j < i; j++)
		{
			if (array[i] == array[j])
			{
				i--;
				break;
			}
			else
			{
				;
			}
		}*/
	}

	return;
}

void print_array(int* array, int size)
{
	int i;
	
	for (i = 0; i < size; i++)
	{
		printf("%d\n", array[i]);
		//cout << array[i] << '\n';
	}

	return;
}