C - Yogurt factory

The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit of yogurt in week i. Yucky’s factory, being well-designed, can produce arbitrarily many units of yogurt each week.

Yucky Yogurt owns a warehouse that can store unused yogurt at a constant fee of S (1 <= S <= 100) cents per unit of yogurt per week. Fortuitously, yogurt does not spoil. Yucky Yogurt’s warehouse is enormous, so it can hold arbitrarily many units of yogurt.

Yucky wants to find a way to make weekly deliveries of Y_i (0 <= Y_i <= 10,000) units of yogurt to its clientele (Y_i is the delivery quantity in week i). Help Yucky minimize its costs over the entire N-week period. Yogurt produced in week i, as well as any yogurt already in storage, can be used to meet Yucky’s demand for that week.
Input
* Line 1: Two space-separated integers, N and S.

• Lines 2..N+1: Line i+1 contains two space-separated integers: C_i and Y_i.
  Output
• Line 1: Line 1 contains a single integer: the minimum total cost to satisfy the yogurt schedule. Note that the total might be too large for a 32-bit integer.
  Sample Input
  4 5
  88 200
  89 400
  97 300
  91 500
  Sample Output
  126900
  Hint
  OUTPUT DETAILS:
  In week 1, produce 200 units of yogurt and deliver all of it. In week 2, produce 700 units: deliver 400 units while storing 300 units. In week 3, deliver the 300 units that were stored. In week 4, produce and deliver 500 units.

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
#define ll long long int 
#define ull unsigned long long int 
#pragma warning(disable:4996)
#define pf printf
#define sf scanf
//#define min(a,b) (a)>(b)?(a):(b);
//double PI = acos(-1.0);

/*
从第一周开始遍历，每过一周把之前的价格上涨S（相当于把存储的费用直接算到价格中），然后从之前的所有价格中选择一个最低价来生产本周的酸奶就ok了。
*/
int main(void) {
    int cy[10005][2];
    ull ans=0;
    int min;
    int n, s;
    cin >> n >> s;
    for (int i = 0; i < n; i++)
        sf("%d%d", &cy[i][0], &cy[i][1]);

    min = cy[0][0];
    for (int i = 0; i < n; i++) {
        if (cy[i][0] < min)
            min = cy[i][0];
        ans += cy[i][1] * min;
        min += s;
    }

    cout << ans << endl;

    return 0;
}