Pizza Location - NDDCoder

#include<iostream>

using namespace std;
int k, r, m, n;
int loc_x[20], loc_y[20], used[20];
int soli_x[100], soli_y[100], pop[100], covered[100];
int inside[20][100];
int maxp;

int square(int x){
	return x*x;
}

int isInside(int x1, int y1, int r, int x2, int y2){
	return square(x1-x2)+square(y1-y2) <= square(r);
}

void Try(int rest, int loc, int ppl){
	if (rest>=k){
		if (ppl > maxp) maxp=ppl;
		return;
	}
	for (int l=loc;l<m;l++){
		int notCoveredPop = 0;
		for (int i=0;i<n;i++){
			if (!covered[i] && inside[l][i]) notCoveredPop+=pop[i];
			if (inside[l][i]){
				covered[i]++;
			}
		}
		Try(rest+1, l+1, ppl+notCoveredPop);
		for (int i=0;i<n;i++){
			if (inside[l][i]){
				covered[i]--;
			}
		}		
	}

}

int main(){
	freopen("PizzaLocation.txt","r",stdin);
	int T;
	cin>>T;
	for (int tc=1;tc<=T;tc++){
		cin>>k>>r;
		cin>>m;
		for (int i=0;i<m;i++){
			cin>>loc_x[i]>>loc_y[i];
			used[i]=0;	
		} 
		cin>>n;
		for (int i=0;i<n;i++){
			cin>>soli_x[i]>>soli_y[i]>>pop[i];
			covered[i]=0;
		}
		
		for (int i=0;i<m;i++){
			for (int j=0;j<n;j++){
				if (isInside(loc_x[i], loc_y[i], r, soli_x[j], soli_y[j])) inside[i][j]=1;
				else inside[i][j]=0;
			}
		}
		
		maxp=0;
		Try(0, 0, 0);
		cout<<"#"<<tc<<" "<<maxp<<endl;
	}
}