PAT 甲级 A1033 To Fill or Not to Fill 测试点2一直不过orz 对晴神宝典也没对出来 等个大佬

#include 
#include 
using namespace std;
struct NODE {
	double price;
	double dis;
}node[100010];
bool cmp(NODE a,NODE b)
{
	if(a.dis != b.dis)
	{
		return a.dis < b.dis;
	}
} 
int main()
{
	double cmax,d,davg;
	int n;
	scanf("%lf%lf%lf",&cmax,&d,&davg);
	scanf("%d",&n);
	for(int i=0;i