年轻人不讲码得用sort来偷袭

int maximumGap(int a,double x[])
 {
	sort(x, x + a);
	for (int i = 0; i < a - 1; i++)
		d[i] = x[i + 1] - x[i];
	sort(d, d + a - 1);
	cout.setf(ios::fixed);
	cout << fixed << setprecision(2) << d[a - 2] << endl;
	return 0;
}