Tematica siruri [X]

#include <iostream>

using namespace std;

int main()
{
    ///Gasiti min prin prima jumatate si max din a II-a jumatate
    ///n par
    int a[1000], n, minn, maxx;
    cin >> n;
    for( int i=1; i<=n; i++){
        cin >> a[i];

    }
    minn =a[1];
    for(int i=1;i<=n/2;i++)
    {

        if(a[i]<minn)
            minn=a[i];
    }
    maxx=a[n/2+1];
    for (int i=n/2+1; i<=n; i++) {
        if (a[i]> maxx) {
            maxx=a[i];
        }
    }
    cout << minn << " " << maxx;
    return 0;
}
/** Tematica siruri
- min,max
- parcurgeri pe secvente
- sume, produse, medii
- cautari ale unor valori
- verificari paritate, comparari
*/