Taxing Problem

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define double long double
double s[21];
double p[21];
const double EPS = 1e-10;
int main(){
	int B;
	cin>>B;
	for(int i=0;i<B;++i)
		cin >> s[i] >> p[i], p[i] /= 100;
	
	double P;
	cin >> P;
	P /= 100;
	
	int F;
	cin >> F;
	for(int j=0; j<F; ++j){
		double e,m;
		cin>>e>>m;
		
		int i;
		for(i=0;i<B;++i){
			if(e<s[i])break;
			e-=s[i];
		}
		double pretax=0;
		for(;i<B;++i) {
			if (fabs(p[i]-1)<EPS)
				continue;
			if (m / (1-p[i]) < s[i]-e) {
				double step = m / (1-p[i]);
				pretax += step;
				m = 0;
				e = 0;
			} else {
			
				double step = s[i]-e;
				pretax += step;
				m -= step * (1-p[i]);
				e = 0;
			}
			//pretax += min(m, s[i]-e) / (1-p[i]);
			//if(s[i]-e<m)m-=s[i]-e-min(m,s[i]-e)*p[i];
			//else m=0;
			//e=0;
		}
		pretax+=m/(1-P);
		cout.precision(20);
		cout<<fixed<<pretax<<'\n';;
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED