Submission #1258856

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <numeric>
using namespace std;
int main(){
	long int ansnum=0,num=0;
	unsigned long long int q,k,d,j;
	unsigned long long int ans[100000];
	unsigned long long int day[100000] = {0};
	unsigned long 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 > d*k) ? d*k : j;
				num++;
			}else{
				cin >> d;
				if((order[j] += d) > day[j]*k)
					order[j] = day[j]*k;
			}
			
		}else{
			j=0;
			cin >> d;
			for(int l=0;l<num;l++){
				if(day[l] <= d)
					j += order[l];
			}
			ans[ansnum] = ((d=d*k) > j) ? j:d;
			ansnum++;
		}
	}
	for(int i=0;i<ansnum;i++)	cout << ans[i] << endl;
}

Submission Info

Judge Result