大佬们帮忙看下，WA了第三个点

#include<iostream>
#include<bits/stdc++.h>//万能头文件 
#include<cstdio>
#include<cmath>
#include<algorithm>//sort函数库 
#include<cstring>
#include<cstdlib>
#include<ctime>
#define gets(S) fgets(S,sizeof(S),stdin)
using namespace std;
int num[1000000];
bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	int n;
	cin >> n;
		for (int i = 1; i <= n; i++)
		{
			cin >> num[i];
		}
	int maxn;
	cin >> maxn;
	sort(num + 1, num + n + 1, cmp);
	for(int i=1;i<=n;i++)
	{
		if(num[i]>maxn)
		{
			num[i]=99999999;
		}
		else
		{
			maxn=num[i];break;
		}
	}
	sort(num + 1, num + n + 1,cmp);
	int ans = 0;
	for (int i = n; i >= 1; i--)
	{
		if (num[i] <= maxn)
		{
			maxn -= num[i]; ans++;
		}
		else
		{
			break;
		}
	}
	cout << ans;
	return 0;
}