#include <cstdio>
#include <queue>

using namespace std;

int main()
{
    priority_queue<int, vector<int>, greater<int> > heap;
    int n; scanf("%d", &n);
    while ( n -- )
    {
        int x; scanf("%d", &x);
        heap.push(x);
    }
    printf("%d", heap.top());
    return 0;
}

或

#include <iostream>

using namespace std;

int main()
{
    int n; cin >> n;
    int res = 1 << 30;
    while ( n -- )
    {
        static int x; cin >> x;
        res = min(res, x);
    }
    
    cout << res;
    return 0;
}