Pizzeriat

#include <cmath>
#include <climits>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;

	vector<int> prices;
	prices.resize(n);

	priority_queue<pair<int, int>> mp;

	for(int i = 0; i < n; i++)
	{
		cin >> prices[i];
		mp.push({prices[i], i});
	}

	for(int i = 0; i < k; i++)
	{
		int t;
		cin >> t;

		if(t == 1)
		{
			int a, b;
			cin >> a >> b;
			a--;

			prices[a] = b;
			mp.push({b, a});

			while(prices[mp.top().second] != mp.top().first) mp.pop();
		}

		if(t == 2)
		{
			int a;
			cin >> a;
			a--;
			
			int ret = INT_MAX;
			for(int j = max(0, a - mp.top().first); j <= min(n - 1, a + mp.top().first); j++)
			{
				int c = abs(j - a) + prices[j];
				if(c < ret)
					ret = c;
			}

			cout << ret << endl;
		}
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED