quicksort 2010-07-10 02:31:00
点我顶贴
收藏
删除
#include<iostream>
using namespace std;
long long i,m,tot,u,f,d,t;
char c;
int main()
{
cin>>m>>t>>u>>f>>d;
u+=d; f*=2;
for (i=1;i<=t;++i)
{
scanf("%c",&c);
if (c=='f') tot+=f;
else tot+=u;
if (tot>m) break;
}
cout<<i-1<<endl;
return 0;
}