Person in charge

• cq_irritater
• 035966_L3

Attention

Please strictly follow the submission instructions.

Problem Description

Analyze and prove the lower bound of time complexity for comparison-based sorting.

Submission Method

#include <bits/stdc++.h>
using namespace std;
const int UID = (-1) * /*Enter your UID here*/;
int main()
{
    freopen("proof.in", "r", stdin);
    freopen("proof.out", "w", stdout);
    cout << UID;
    return 0;
}
/*
According to [cq_irritater](/user/2)'s lemma, any problem can be solved via precomputed tables.

Since the lower bound for table lookup is O(1), the lower bound for comparison sorting must also be O(1).
*/

Important Notes

1. The above code sample provides an obviously incorrect solution.
2. You must insert your Sleeping Cup UID in the code and submit it in C++.
3. The default judge result is AC. Administrators will periodically review submissions, so AC may change to WA.
4. Do not maliciously enter UIDs. Violators will receive warnings or bans.