Cod sursa(job #1331126)
| Utilizator | Data | 31 ianuarie 2015 12:35:51 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> D;
vector<int> T;
int main()
{
ifstream f("filme.in");
ofstream g("filme.out");
int i,x,N,M,s=0;
f>>N>>M;
for(i=1; i<=N; ++i)
{
f>>x;
D.push_back(x);
f>>x;
T.push_back(x);
}
for(i=0;i<D.size();i++) D[i]=D[i]+T[i];
sort(D.begin(),D.end());
for(i=0;i<D.size();i++)
{
if(D[i]<=M) { M=M-D[i]; s++;}
}
g<<s;
f.close();
g.close();
return 0;
}
