Cod sursa(job #635204)
Utilizator | Data | 18 noiembrie 2011 19:20:57 | |
---|---|---|---|
Problema | Gutui | Scor | 10 |
Compilator | cpp | Status | done |
Runda | teme_upb | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
ifstream in("gutui.in");
ofstream out("gutui.out");
const int N=100001;
int n,height,u,offset,rez,maxg;
priority_queue< pair<int,int> > heap;
int main(){
int i,x,y;
in>>n>>height>>u;
for(i=1;i<=n;++i){
in>>x>>y;
heap.push(make_pair(y,x));
}
for(i=1;i<=n;i++){
if(heap.top().second+offset<=height){
rez+=heap.top().first;
}
heap.pop();
}
out<<rez;
return 0;
}