```
#include<bits/stdc++.h>
using namespace std;
int a[100000000];
int main()
{
int n,m,k,w,r,t,tt=0;
cin>>n>>m>>k>>w>>r;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
t=m/k*r*w;
for(int i=0;i<n&&t>0;i++)
{
t-=a[i];
a[i]=-1;
tt++;
}
cout<<n-tt;
return 0;
}
```
by 幻影学霸刘 @ 2019-01-05 11:19:22
# 我也是33
by 幻影学霸刘 @ 2019-01-05 11:19:45
跟你的好像
by 幻影学霸刘 @ 2019-01-05 11:20:08
#include <bits/stdc++.h>
using namespace std;
int a[10000001];
int main()
{
int n,m,k,w,r,ta,wei,ans=0;
cin>>n>>m>>k>>w>>r;
for (int i=1;i<=n;i++)
cin>>a[i];
ta=m/k;
wei=ta*w*r;
for (int i=1;i<=n;i++)
if (wei<a[i]) ans++;
cout<<ans;
return 0;
}
by 文宇浩 @ 2019-01-20 21:25:38
难兄难弟
by 文宇浩 @ 2019-01-20 21:26:02
33 分+1
by lytqwq @ 2019-01-23 08:14:19
33+1分
by Sh4kespeare @ 2019-01-30 15:09:32
#include<bits/stdc++.h>
using namespace std;
int a[100100];
int main()
{
int n,m,k,w,r,i,s=0,t=0;
cin>>n>>m>>k>>w>>r;
t=m/k;
t=t*w;
t=t*r;
for(i=1;i<=n;i++){
cin>>a[i];
if(a[i]>t)
s++;
}
cout<<s;
return 0;
}
by Sh4kespeare @ 2019-01-30 15:09:42
@[幻影学霸刘](/space/show?uid=101301) 我也是
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,m,k,w,r,a[1000000];
int main()
{
cin>>n>>m>>k>>w>>r;
int power=m/k*w*r;
for (int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1);
int i=1;
while (power)
{
power-=a[i];
i++;
if (i>n) break;
}
if (power)
cout<<n;
else
cout<<n-i+1;
return 0;
}
```
by yagyagyag @ 2019-02-01 22:23:16
# 我也是33分
by 南楼故语 @ 2019-02-12 08:45:09