PAT A1044 Shopping in Mars

用lower_bound二分法找到与i的和大于等于m的下标。
然后用sort将sum排序。。
最后将最小的和（即差值等于m，或稍大于m）输出即可。

#include<iostream>
#include <algorithm>
using namespace std;
struct node
{
	int a;
	int b;
	int sum;
};
int cmp(node a, node b)
{
	if (a.sum != b.sum)
		return a.sum < b.sum;
	else
		return a.a < b.a;
}
int main()
{
	int n, m;
	cin >> n >> m;
	int i;
	int *s = new int[n];
	int *sum = new int [n];
	node *x = new node[n];
	for (i = 0; i < n; i++)
	{
		cin >> s[i];
	}
	int sum1 = 0;
	int temp = 0;
	int flag = 0;
	for (i = 0; i <= n; i++)
	{	
		sum[i] = sum1;
		sum1 += s[i];
	}
	for (i = 0; i < n+1; i++)
	{
		x[temp].b = lower_bound(sum+i, sum+n+1, sum[i]+m)-sum;
		if (x[temp].b >= n+1)continue;
		x[temp].a = i;
		x[temp].sum = sum[x[temp].b] - sum[x[temp].a];
		temp++;
	}
	sort(x, x + temp, cmp);
	for (i = 0; i < temp; i++)
	{
		if (i == 0)
		{
			cout << x[i].a+1 << "-" << x[i].b << endl;
		}
		else if (x[i].sum == x[i - 1].sum)
		{
			cout << x[i].a+1 << "-" << x[i].b << endl;
		}
		else break;
	}
	system("pause");
	return 0;
}