Need help

Revision en1, by Sammmmmmm, 2024-02-07 06:20:36

Given an array of n integers and k. Count the number of permutations of the array so that the sum of each adjacent element >= k. Two permutations are different if they are different as arrays (There exists an index i so that a[i] != b[i])

N <= 2e5; K, Ai <= 1e9

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Sammmmmmm 2024-02-07 06:20:36 274 Initial revision (published)