#include<bits/stdc++.h>
using namespace std;
int a[10001];

int main () {
	int n,maxx=INT_MIN,minn=INT_MAX; cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		maxx = maxx<a[i]?a[i]:maxx;
		minn = minn>a[i]?a[i]:minn;
	}
	cout << maxx-minn;
	return 0;
}

定义最好放在外面

#include<bits/stdc++.h>
using namespace std;
int m,ma=0,mi=10001;
int a[10005];
int main(){
	cin>>m;
	for(int i=0;i<m;i++) cin>>a[i];
	for(int i=0;i<m;i++){
		ma=max(ma,a[i]);
		mi=min(mi,a[i]);
	}
	cout<<ma-mi<<"\n";
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
short n,num,maxx=SHRT_MIN,minn=SHRT_MAX;
int main(){
   cin>>n;
   for(int i=1;i<=n;i++){
      cin>>num;
      if(num>maxx) maxx=num;
      if(num<minn) minn=num;}
   cout<<maxx-minn;
   return 0;
}

#include<bits/stdc++.h> 
using namespace std;
int main(){
   int m,maxn=-10000000,mini=10000000;//max开小一点，避免初始值为0时有负数数录不进去，mini也一样
   cin>>m;
   int a[m];
   for(int i=0;i<=(m-1);i++){
      cin>>a[i];
      mini=a[i]<mini? a[i]:mini;//取最大最小值
      maxn=a[i]>maxn? a[i]:maxn;
   }
   cout<<(maxn-mini);





   return 0; 

#include<iostream>
#include<queue>
#include<stack>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std; 
int main()
{
	int a;
	cin>>a;
	int b[10010];// 开大一点，不然会报Wrong Answer！！
	int i=0;
	int n=a;
	while(n--)
	{
		i++;
		cin>>b[i];
	}
	sort(b,b+a);//用sort排序快一点，注意用法！！sort(?,?+?);
	int m=b[a-1]-b[0];
	cout<<m;
    return 0;

}

#include<bits/stdc++.h> using namespace std; int main(){ int a; int zd=0,zx=1000000; cin>>a; int b[a]; for(int i=0;i<a;i++){ cin>>b[i]; }for(int i=0;i<a;i++){ if(b[i]>=zd){ zd=b[i]; }if(b[i]<=zx){ zx=b[i]; } } cout<<zd-zx; }

#include #include #include using namespace std; int main(){ int n; cin>>n; int x; cin>>x; int t=x; for(int i=2;i<=n;i++){ cin>>x; if(x>t) t=x; } cout<<t; }

#include <iostream>
#include <algorithm>
using namespace std;
int n,m,ans=0,a[10005];
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;
}

#include<bits/stdc++.h> using namespace std;

int main(){ int n,maxn,minn; cin>>n; const int N=n; int a[N]; for(int i=0;i<N;i++){ cin>>a[i]; } maxn=a[0]; minn=a[0]; for(int j=0;j<N;j++){ maxn=max(maxn,a[j]);

}
for(int k=0;k<N;k++){
	minn=min(minn,a[k]);
}
cout<<maxn-minn;
return 0;

}

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv){
	int m,x,mx = -10005,mn = 10005;
	cin >> m;
	for (int i = 0;i < m;i++){
		cin >> x;
		mx = max(mx,x);
		mn = min(mn,x);
	}
	cout << mx - mn;
	return 0;
}