贪心算法时间效率更高

#include<bits/stdc++.h>
using namespace std;
struct info{
int piece;
int weight;
int num;
double everypiece;
};
bool cmp(info a,info b){
return a.everypiece>b.everypiece;
}
int main(){
int n,total,ans=0,now=0;
cin>>n>>total;
info box[n];
for(int i=0;i<n;i++){
cin>>box[i].piece>>box[i].weight>>box[i].num;
box[i].everypiece=box[i].piece1.000/box[i].weight;
}
sort(box,box+n,cmp);
for(int i=0;i<n&&now<total;i++){
int maxTake=min(box[i].num,(total-now)/box[i].weight);
if(maxTake>0){
ans+=box[i].piecemaxTake;
now+=box[i].weight*maxTake;
}
}
cout<<ans;
}