Question

Fie tabloul unidimensional x[1], x[2], ..., x[n] cu n>=3, care contine numere intregi distincte. Scrieti secventa de program C++ care elimina din tablou minimul si maximul.
Exemplu daca n=8 si x=(5,6,9,8,1,7,2,3) => x=(5,6,8,7,2,3)

Answer 1

#include <iostream>
using namespace std;
int n,i,Max,Min,v[100],p1;
int main()
{ Min=36000;
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i];
    for(i=1;i<=n;i++)
    {
        if(v[i]>=Max){Max=v[i];p1=i;}
        if(v[i]<=Min){Min=v[i];}
    }
    for(i=p1;i<n;i++)
        v[i]=v[i+1];
        n--;
    for(i=1;i<=n;i++)
        if(v[i]==Min)p1=i;

        for(i=p1;i<n;i++)
        v[i]=v[i+1];
        n--;

for(i=1;i<=n;i++)
    cout<<v[i]<<" ";
}