Given an array of integers, your task is to find the smallest and second smallest element in the array. If smallest and second smallest do not exist, print -1.

To find the smallest and second smallest elements in an array of integers, follow these steps:

1. Initialize two variables, smallest and second_smallest, with values that are greater than any possible element in the array. For example, you can set smallest to infinity and second_smallest to infinity + 1.

2. Iterate through each element in the array.

3. Compare the current element with the value of smallest. If the current element is smaller than smallest, update smallest with the value of the current element.

4. If the current element is not smaller than smallest but smaller than second_smallest, update second_smallest with the value of the current element.

5. After iterating through all the elements, check if second_smallest is still greater than smallest. If it is, it means that there is no second smallest element in the array. In this case, print -1.

6. Otherwise, print the values of smallest and second_smallest.

Here is an example implementation in Python:

def find_smallest_and_second_smallest(arr):
    smallest = float('inf')
    second_smallest = float('inf') + 1

    for num in arr:
        if num < smallest:
            second_smallest = smallest
            smallest = num
        elif num < second_smallest and num != smallest:
            second_smallest = num

    if second_smallest == float('inf') + 1:
        print(-1)
    else:
        print(smallest, second_smallest)

You can call this function with your array as an argument to find the smallest and second smallest elements.