Pagini recente » Diferente pentru problema/eval intre reviziile 27 si 1 | Monitorul de evaluare | Cod sursa (job #679273) | Cod sursa (job #1689787) | Cod sursa (job #3355396)
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
bool sortare(pair<float, float> a, pair<float, float> b) {
return a.second / a.first > b.second / b.first;
}
int main() {
int n, g;
fin>>n>>g;
vector<pair<float, float>> a(n + 1);
for(int i = 0; i < n; i++) {
fin>>a[i].first>>a[i].second;
}
int s = 0, s2 = 0;
sort(a.begin(), a.end(), sortare);
for(int i = 0; i < n; i++) {
if(s < g) {
s += a[i].first;
s2 += a[i].second;
}
}
fout<<s2;
return 0;
}