having a lot of trouble, please solve and explain

Alan's so impressed with your bolt sorting that you've been asked back to help with a stack of mismatched scrap wood. Specifically, Alan has a bunch of 24 pieces of wood left over from previous projects. They're all different lengths. Alan would like to make best use of these leftovers for future projects. Construct an O(nlogn) time algorithm to help Alan solve this problem: Given a project that requires a 24 of length t, does Alan have pieces of wood such that the need could be filled by exactly one or two left over pieces of wood (with no need to cut any wood)? Assume you have an array W that contains n distinct values that are the lengths of the leftover pieces of wood. Your algorithm should return simply "yes" or "no" to answer whether one or two of these pieces of wood will solve the project's need