Can someone tell what is wrong with my code ?

Here is my code :-

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<limits.h>
using namespace std;
bool maps[501][100001];
int main(){
	int ans = 0;
	for(int i=0;i<501;++i){
		for(int j=0;j<100001;++j){
			maps[i][j] = true;
		}
	}
	int n;
	scanf("%d" , &n);
	for(int i=0;i<n;++i){
		int x , y;
		scanf("%d%d" , &x , &y);
		maps[y][x] = false;
	}

The reason you are getting TLE is that your algorithm has time complexity of O(N log N) and my algorithm has time complexity of O(N). This is because your algorithm requires sorting of the array and my algorithm doesn't.

Please show me the code so that I may help you. I got 100 points for this question.

Hussain , Thanks for your help. Got AC :D .

Here is a short 4 min video from GeeksforGeeks :-

Now a question to solve :-

WSITE01

Getting SEG in test case 0 , 8 , 9.

Here is my code :-

#include <bits/stdc++.h>
using namespace std;
 
class edge{
	public:
	int st , en , cst;
};
bool cmp(edge a , edge b){
	return a.cst < b.cst;
}
int find(int parent[], int i){
	if(parent[i] == -1)
		return i;
	find(parent , parent[i]);	
}
void Union(int parent[] , int x , int y){
	int xs = find(parent , x);
	int ys = find(parent , y);
	parent[xs] = ys;
}

Why is Eclipse or IntelliJ not available for JAVA but Dev C++ or Code Blocks are available for C++ during the ZCO exam ?

Hussain , Thanks for helping me . I got AC after simplifying the first part of my code by the suggested method . I too believe that I had complicated it unnecessarily.

Getting WA in some of the testcases :-

#include<stdio.h>
#include<iostream>
#include<cmath>
#include<limits.h>
using namespace std;
 
bool map[500][500];
int val[500][500];
int main()
{
	int N , P;
	scanf("%d %d" , &N , &P);
	for(int i=0;i<N;++i){
		for(int j=0;j<N;++j){
			cin >> val[i][j];
			map[i][j] = false;
		}
	}
	while(P>0){
		--P;
		int x , y , k;
		scanf("%d %d %d" , &y , &x , &k);

Hussain , Thank you for trying to debug my code. I think there is a problem with some of their test cases.