Submission #1271302

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
	long int ansnum = 0, num = 0;
	unsigned long int q, k, d, j;
	static unsigned long int ans[100000];
	static unsigned long int day[100000] = { 0 };
	static unsigned long int order[100000];

	cin >> q >> k;
	for (int i = 0; i<q; i++) {
		cin >> d;
		if (d == 1) {
			cin >> d;
			if (!(day[j = (find(&day[0], &day[num], d) - day)])) {
				day[num] = d;
				cin >> j;
				order[num] = j;
				num++;
			}
			else {
				cin >> d;
				order[j] += d;
			}

		}
		else {
			j = 0;
			cin >> d;
			for (int l = 0; l<num; l++) {
				if (day[l] <= d)
					j += (day[l]*k > order[l]) ? order[l] : day[l]*k;
			}
			ans[ansnum] = (d*k > j) ? j : d*k;
			ansnum++;
		}
	}
	for (int i = 0; i<ansnum; i++)	printf("%lu\n",ans[i]);
}

Submission Info

Judge Result