Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("ramen.in");
- ofstream g("ramen.out");
- int n,i,x,prep,sc,j,ok,sol[100001],y,timp;
- pair<pair <int ,int>,int> v[100001];
- set <int > heap1;
- set <int >::iterator it;
- int main()
- {
- f>>n>>prep;
- for(i=1; i<=n; i++)
- {
- f>>v[i].first.second>>v[i].first.first;
- v[i].second=i;
- heap1.insert(v[i].first.second+prep);
- }
- sort(v+1,v+n+1);
- for(j=1;j<=n;j++)
- { timp=v[j].first.second-v[j].first.first;
- it=heap1.lower_bound(timp);
- sol[v[j].second]=*it+v[j].first.first;
- heap1.erase(it);
- }
- for(i=1; i<=n; i++)
- g<<sol[i]<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement