挥肠简单的一道题辣👀️

思路：找到数组中最小值，把最小值跳过输出数组中的各个元素

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

思路：vector的erase函数删除

#include <bits/stdc++.h>
using namespace std;
int main()
{
    vector<int> v;//定义向量
    int n;
    //输入
    cin >> n;
    for (int i = 1;i <= n;i++)
    {
        int t;
        cin >> t;
        v.push_back(t);
    }
    vector<int>::iterator minj = v.begin();//定义送代器
    for (vector<int>::iterator it = v.begin();it != v.end();it++)//遍历向量
    {
        //打擂台求最小值
        if (*minj >= *it)
        {
            minj = it;
        }
    }
    //删除
    v.erase(minj);
    //输出
    for (int i = 0;i < v.size();i++)
    {
        cout << v[i] << " ";
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[110],n,mi;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	mi = a[0];//查找最小的数
	for(int i = 1; i < n; i++){
		if(a[i] < mi){
			mi = a[i];
		}
	} 
	//输出除了最小数以外的数
	for(int i = 0; i < n; i++){
		if(a[i] != mi){
			cout << a[i] << " ";
		}
	} 
	return 0;
}