POJ 2393 Yogurt factory

• Source Code

  #include<iostream>#include<cstdio>#include<queue>#include<functional>using namespace std;int main(){long long N, S;while (cin >> N >> S){long long a[10002], b[10002];for (int i = 1; i <= N; i++)cin >> a[i] >> b[i];long long unit = 0, sum = 0;for (int i = 1; i <= N; i++){int t = 0, unit = b[i],store=0;for (int j = i + 1; j <= N; j++){if (a[j] - a[j - 1]>=S) t++, unit = unit + b[j],store=store+b[j]*t*S;else break;}if (t > 0){sum = sum + a[i] * unit + store; unit = 0; i = i + t;}else sum = sum + a[i] * unit + store;}cout << sum << endl;}return 0;}