A1033 To Fill or Not to Fill (25 分)

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cctype>
using namespace std;
int Cmax, D, Davg, N;
double pri[30010];
const int maxp = 99999;
int main(){	
	scanf("%d %d %d %d", &Cmax, &D, &Davg, &N);
	for(int i = 0; i < 30010; i++){
		pri[i] = maxp;
	}
	double pi;
	int pos;
	for(int i = 0; i < N; i++){
		scanf("%lf %d", &pi, &pos);
		for(int j = pos+1; j <= pos+Cmax*Davg && j < 30010; j++){
			pri[j] = min(pri[j], pi/Davg);
		}
	}
	int dis = 1;
	double sum = 0;
	for(; dis <= D; dis++){
		if(pri[dis] == maxp){
			break;
		}else{
			sum += pri[dis];
		}
	}dis--;
	if(dis == D) printf("%.2f", sum);
	else printf("The maximum travel distance = %.2f", (double)dis);	
	return 0;
}