finding second smallest number using Dynamic Memory Allocation

[MrTaj]

I have to code a program to find the smallest and the second smallest number form entered numbered by user.

Here is my code but it gets wrong answers for second smallest number in some cases.

for example:

if I enter :
10
2 3 5 6 7 4 5 8 0 39
it works correct (answer 0 2)
but if enter:
5
1 2 3 4 5

it gets wrong answer.

  #include <iostream>
using namespace std;

int main()
{
int *p;
int x;

cout << "Enter a number of student: ";
cin >> x;
p = new int[x];

for (int i = 0; i < x; i++)
{
cout << "Enter a grade: ";
cin >> *(p + i);
}
int min = 0;
int secmin = 0;
min = *p;
    for (int i=0; i<x; i++)
{
    if (*(p+i) < min)
    {
        secmin = min;
        min = *(p+i);
    }
    else if( *(p+i) < secmin)
        secmin = *(p+i);
/*  else 
    {
        secmin = *(p+i);    
    } */
}

cout << "Min num is : "<< min << "\nSecond Min num is: " << secmin <<  endl;

} 

Thanks in Advance

[MrTaj]

any ideas?

[ne555]

int secmin = 0;

[MrTaj]

@ne555
what should I do with that?

[ne555]

Explain it.
¿why did you set it to 0? ¿what if all the elements are greater than that?