algorithm - Asymptotic lower bound of O(n^2) -

Is there a problem in P, which is the uncompressive lower bound, defined as O (N ^ 2) or higher? (N is a number of bits can be represented as a problem example). This is not a question of homework, just curiosity.

Yes, such problems exist. They are not arguably naturally because they include all O (n ^ 2) -times alignment on time algorithms.