第一个点本地输出正确，但是提交就RE，

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>

using namespace std;
const int maxn = 100000 + 10;
int aim;
int tprice, tamount;

int r = -1, l = maxn - 10;
int amount[maxn];

int k;

int main()
{
	cin >> aim;
	while (cin >> tprice >> tamount && tprice != -1)
	{
		amount[tprice] = tamount;
		r = max(tprice, r);
		l = min(tprice, l);
	}

	for (int nl = l; nl <= r; nl++)
	{
		int nr;
		for (nr = nl + 1; amount[nr] == 0; nr++);
		int k = (amount[nr] - amount[nl]) / (nr - nl);
		for (int cur = nl + 1; cur<nr; cur++)
		{
			amount[cur] = (cur - nl)*k + amount[nl];
		}
		nl = nr;
	}

	cin >> k;

	for (; amount[r] - k > 0; r++) amount[r + 1] = amount[r] - k;

	double minx = -0x3f, maxx = 0x3f;
	int cb = l;

	for (int cur = l; cur <= r; cur++)
	{
		double sh = (cb - aim)*amount[aim] + (cur - cb) * amount[cur];
		double xi = amount[aim] - amount[cur];
		if (xi>0)
		{
			minx = max(sh / xi, minx);
		}
		else if (xi<0)
		{
			maxx = min(sh / xi, maxx);
		}
	}

	minx = ceil(minx);
	maxx = floor(maxx);

	if (minx <= maxx)
	{
		int p = abs(minx)<abs(maxx) ? minx : maxx;
		cout << p;
	}
	else cout << "NO SOLUTION";

	return 0;
}