Submission #1339940

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const llint mod=100000007;
const llint big=1e9;
const llint red=0xE869120;
const llint pro=1002001;
int main(void){
	int a,b,i,j,ans=0,gen,bmax,bmin,q,w,n,m;
	string str;
	vector<int> vec;
	cin>>n;
	vec.res(n);
	for(i=0;i<n;i++){cin>>vec[i];}
	sort(vec.begin(),vec.end());
	cout<<(vec[n-1]-vec[0])<<endl;
	return 0;
}

Submission Info

Judge Result