bool fuct(p a, p b){
	if(a.s >= b.s) return true;
	return false;
}

In short, your "true" condition is ambiguous: with two objects $$$a$$$ and $$$b$$$ having the same parameters $$$s$$$, both statements $$$a \lt b$$$ and $$$b \lt a$$$ is true (the comparator in sort function will return true if the first argument is considered "lower" than the second one), therefore either cause a TLE or reach maximum recursion depth by continuously swapping such elements.