222282026-01-14 18:14:52algoproBenzinkút üzemeltetés (55)cpp17Wrong answer 0/553ms404 KiB
// UUID: b9a35d8d-de9d-4d80-b8c4-cc6590be50f1
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, tav; cin>>N>>tav;
	vector<pair<int, int>> V(N+1);
	vector<int> dp(N+1, 0);
	V[0].first=-tav-1;
	for(int i=1; i<=N; i++) cin>>V[i].first>>V[i].second;//1: tav, 2:haszon
	for(int i=1; i<=N; i++)
	{
		int j=0;
		do
		{
			dp[i]=max(dp[i], dp[j]+V[i].second);
			j++;
		}while(V[j].first+tav<=V[i].first);
	}
	cout<<dp[N];
}
SubtaskSumTestVerdictTimeMemory
base0/55
1Wrong answer0/01ms316 KiB
2Wrong answer0/02ms316 KiB
3Wrong answer0/31ms316 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms396 KiB
10Wrong answer0/31ms316 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms404 KiB
13Wrong answer0/42ms316 KiB
14Wrong answer0/42ms316 KiB
15Wrong answer0/53ms316 KiB
16Wrong answer0/62ms316 KiB
17Wrong answer0/62ms384 KiB