Count Pairs Whose Sum is Less than Target

Count the number of index pairs (i < j) in an array whose elements sum to less than a given target — a two-sum variant typically solved by sorting and using a two-pointer scan to count valid pairs efficiently (or by brute force given n ≤ 50).