Submission #1608227

---

Source Code Expand

#include<iostream>
#include<queue>
using namespace std;
int main(){
	priority_queue<int,vector<int>,greater<int> > q1;
	priority_queue<int > q2;
	int n,a;
	cin>>n;
	int i=0;
	for(i=0;i<n;i++){
		cin>>a;
		q1.push(a);
		q2.push(a);
	}
	int b,c;
	b=q1.top();
	c=q2.top();
	int d;
	d=c-b;
	cout<<d<<endl;
	return 0;
}

Submission Info

Judge Result