15分求调

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

const int N = 10000;
int nums[N];
vector<int> minl;
vector<int> minr;
vector<int> maxl;
vector<int> maxr;

int main(){
	int n, m;
	cin >> n >> m;
	int MIN = N;
	int MAX = 0;
	for(int i=0;i<n;i++){
		cin >> nums[i];
		MIN = min(MIN, nums[i]);
		MAX = max(MAX, nums[i]);
	}
	while(m){
		if(MAX == MIN) break;
		int ll = 0, rr = 0;
		bool st = false;
		for(int i=0;i<n;i++){
			rr = i;
			if(nums[i] == MIN) st = true;
			if(nums[i] == MAX){
				rr = i-1;
				if(st){
					minl.push_back(ll);
					minr.push_back(rr);
					st = false;
				}
				ll = i+1;
				rr = i+1;
			}
		}
		if(ll <= rr && rr < n && st){
			minl.push_back(ll);
			minr.push_back(rr);
		}
		
		ll = 0, rr = 0;
		st = false;
		for(int i=0;i<n;i++){
			rr = i;
			if(nums[i] == MAX) st = true;
			if(nums[i] == MIN){
				rr = i-1;
				if(st){
					maxl.push_back(ll);
					maxr.push_back(rr);
					st = false;
				}
				ll = i+1;
				rr = i+1;
			}
		}
		if(ll <= rr && rr < n && st){
			maxl.push_back(ll);
			maxr.push_back(rr);
		}
		
		if(minl.size() <= maxl.size()){
			while(minl.size()){
				ll = minl.back(), rr = minr.back();
				minl.pop_back(), minr.pop_back();
				for(int i=ll;i<=rr;i++){
					nums[i]++;
				}
				m--;
				if(m == 0) break;
			}
			if(minl.size() == 0) MIN++;
		}else{
			while(maxl.size()){
				ll = maxl.back(), rr = maxr.back();
				maxl.pop_back(), maxr.pop_back();
				for(int i=ll;i<=rr;i++){
					nums[i]--;
				}
				m--;
				if(m == 0) break;
			}
			if(maxl.size() == 0) MAX--;
		}
		
		maxl.clear();
		minl.clear();
		maxr.clear();
		minr.clear();
		
	}
	cout << MAX - MIN;
	
	return 0;
}