Submission #1606322

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
int mod=1000000007;
typedef long long ll;
using namespace std;
#include<iomanip>
int main(){
	ll n,a,b;
	cin>>n>>a>>b;
	ll sum=0;
	ll Min_rng=mod,Max_rng=-mod;
	lol(i,n){
		ll x;
		cin>>x;
		sum+=x;
		Min_rng=min(Min_rng,x);
		Max_rng=max(Max_rng,x);
	}
	double x=(sum+0.0)/(n+0.0);
	double y=Max_rng-Min_rng;
	if(y==0&&b==0){
		cout<<"0 "<<a-x<<endl;
	}
	else if(y==0){
		cout<<"-1"<<endl;
	}
	else{
		double p=b/y;
		double q=a-x*p;
		cout<<fixed<<setprecision(10)<<p<<" ";
		cout<<fixed<<setprecision(10)<<q<<endl;
	}
	return 0;
}

Submission Info

Judge Result