Optimized resource allocation problem
This is just the assignment problem: you need to find a maximum-weight matching between the users and frequencies.  The Hungarian algorithm solves this in time $O(n^3)$.