代码如下，求助：

#include <bits/stdc++.h>
using namespace std;

int p[1005];

bool cmp(int x, int y)
{
    return x >= y;
}

int main()
{
    int n, m, maxn = 0, ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> p[i];
    }
    sort(p + 1, p + m + 1, cmp);
    for (int i = 1; i <= min(n, m); i++)
    {
        if (maxn <= i * p[i])
        {
        	maxn = i * p[i];
        	ans = p[i];
		}
    }
    cout << ans << ' ' << maxn << endl;
    return 0;
}