Pagini recente » Cod sursa (job #1245218) | Cod sursa (job #1823489) | Monitorul de evaluare | Cod sursa (job #1961953) | Cod sursa (job #1905949)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
struct cont{
int ene, cost;
};
bool cmp(cont x, cont y){
if(x.ene>y.ene) return true;
else if(x.cost<y.cost) return true;
return false;
}
int main(){
int n, energy;
cont t[1002];
fin>>n>>energy;
for(int i=0; i<n; i++)
fin>>t[i].ene>>t[i].cost;
sort(t, t+n, cmp);
int ace=0, crc=0;
for(int i=0; i<n && ace<energy; i++){
ace+=t[i].ene;
crc+=t[i].cost;
}
fout<<crc;
/*for(int i=0; i<n; i++)
fout<<t[i].ene<<" "<<t[i].cost<<"\n";*/
return 0;
}