已纠正问题，感谢挑错团！！！

这一道题还是数组问题，我们就用数组来解决吧~（其实是摆设——数组）首先来缕缕思路吧

1. 最多 20 个数所以将数组 a 设为21个元素
2. 然后每一次都判读值是否大于最大值，成立就把最大值设为这个值
3. 同时也判断值是否小于最小值，成立就把最小值设为这个值
4. 注意！这里最小值可以设为值的最大 + 1，也就是 32767 + 1 = 32768~
5. 最后分别输出最大值和最小值就可以AC啦~

好了！上代码！

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, a[21], maxx = 0, minn = 32768;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] > maxx) maxx = a[i];
        if (a[i] < minn) minn = a[i];
    }
    cout << maxx << " " << minn;
    return 0;
}

够简单吧

#include<bits/stdc++.h>
using namespace std;
int a,maxn;
int main()
{
    int minn=100000;
    while(cin>>a)
    {
        maxn=max(a,maxn);
        minn=min(a,minn);
    }
    cout<<maxn<<" "<<minn;
    return 0;
}

先赞后搬

学过函数的绝对会😄

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[25];
    cin>>n;
    int maxx=-1,minn=32768;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        maxx=max(maxx,a[i]);
        minn=min(minn,a[i]);
    }
    cout<<maxx<<" "<<minn;
}

看完留下你的👍 哦~

为啥要在L5出这种题，弱爆了

#include <iostream>
using namespace std;
int main()
{
    int n, x, maxn = 0, minn = 32768;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> x;
        if (x > maxn)
        {
            maxn = x;
        }
        if (x < minn)
        {
            minn = x;
        }
    }
    cout << maxn << " " << minn;
    return 0;
}

#include <iostream> using namespace std; int main() { int n; cin >> n;定义 int a[n];数组 for(int i = 0; i < n; i++)不要加=。 { cin >> a[i]; } long long maxx = 0, minn = 32768; for(int i = 0; i < n; i++) { if(a[i] > maxx)几？ { maxx = a[i]; } if(a[i] < minn) { minn = a[i]; } } cout << maxx << " " << minn;输出 return 0; }

过辣！（不是我不会写C++，我只是想写个python的，不料核OJ它是真的针对python）

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[100],nnax=-114514,nnin=114514;
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if (a[i]>nnax)nnax=a[i];
        if (a[i]<nnin)nnin=a[i];
    }
    printf("%d %d",nnax,nnin);
    return 0;
}

我现在才发现，核OJ的题都是针对Python党的！

n=int(input())
a=[]
for i in range(1,n+1):
    b=int(input())
    a.append(b)
print(max(a),end=' ')
print(min(a))

简简单单， 哈哈哈

#include <iostream>
using namespace std;
int main()
{
    int n,a,d=0,x=999;
    cin >> n;
    for (int i=0;i<n;i++)
    {
        cin >> a;
        if (a>d)
        {
            d=a;
        }
        if (a<x)
        {
            x=a;
        }
    }
    cout << d <<' ' << x;
    return 0;
}
点赞！

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, a[21], max = 0, min = 32768;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] > max) max = a[i];
        if (a[i] < min) min = a[i];
    }
    cout << max << " " << min;
    return 0;
}

//输入n
cin >> n;
    //输入n个整数进数组a
    for (int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    //进行选择排序，从小到大
   //这里又不懂为什么i要小于n,和j又怎么能等于n的，可以复习下选择排序。
    for (int i=1;i<n;i++)
    {
        for (int j=i+1;j<=n;j++)
        {
            if (a[i]>a[j])
            {
                int t=a[i];
                a[i]=a[j];
                a[j]=t;
            }
        }
    }
    //输出最大值，最小值
    cout << a[n] << " " << a[1]```

#include <bits/stdc++.h>
using namespace std;
int a [20];
int main()
{
    int n;
    cin >> n; 
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    int s=-1,m=10000000;
    for (int i = 1; i <= n; i++)
    {
        if(a[i]>s)
        {
            s=a[i];
        }
        if(a[i]<m)
        {
            m=a[i];
        }
    }
    cout << s << " " << m ;
    return 0;
}

用sort排序找最值

#include <iostream>
#include <algorithm>
using namespace std;   
int n,a[25];
int main()
{
    cin >> n;
    for (int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    sort(a+1,a+n+1);
    cout << a[n]<<" " << a[1];
    return 0;
}

依然是很简单的一道题，使用max和min函数就行了。

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,maxx= -1,minn=44444,a[30];//maxx和minn分别代表最大和最小
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        maxx=max(maxx,a[i]);//使用函数比大小
        minn=min(minn,a[i]);
    }
    cout<<maxx<<" "<<minn;
    return 0;
}

已AC，请放心食用。

#include <iostream>
using namespace std;
int main()
{
    int n, a[100];
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    int maxx = -1, minn = 40000; 
    for (int i = 1; i <= n; i++)
    {
        maxx = max(maxx, a[i]);
        minn = min(minn, a[i]);
    }
    cout << maxx << " " << minn;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[10000];
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    sort(a,a+n);
    cout<<a[n-1]<<" "<<a[0];
    return 0;
}
 用sort函数直接排序 

AC过，放心食用👀️

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int m,n[30],a=-1,b=32768;
    cin >>m;
    for (int i = 1; i <= m; i++)
    {
        cin >>n[i];
        if(n[i]>=a)
        {
            a=n[i];
        }
        if(n[i]<=b)
        {
            b=n[i];
        }
    }
    cout << a << " " << b;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,min=INT_MAX,max=INT_MIN,a[25];
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]>max)
        {
            max=a[i];
        }
        if(a[i]<min)
        {
            min=a[i];
        }
    }
    cout<<max<<" "<<min;
}

够极简了吧

#include<bits/stdc++.h>
using namespace std;
int n,maxn=-1,minn=114514,x;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x;
        maxn=max(maxn,x);
        minn=min(minn,x);
    }
    cout<<maxn<<" "<<minn;
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
    int n, a[21], max = 0, min = 32767;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] > max) max = a[i];
        if (a[i] < min) min = a[i];
    }
    cout << max << ' ' << min;
    return 0;
}

#include <bits/stdc++.h> using namespace std; int main() { int n,a[100],sum=1000000,sam=0; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; if(a[i]>sam) { sam=a[i]; } if(a[i]<sum) { sum=a[i]; } } cout<<sam<<" "<<sum; }