Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- vector< pair<pair<int,int>,bool> >v;
- int n,k;
- long long m;
- bool done[100009];
- int main(){
- cin>>n>>k>>m;
- for(int i=0;i<n;i++){
- int x,y;
- cin>>x>>y;
- v.push_back(make_pair(make_pair(x,i),0));
- v.push_back(make_pair(make_pair(y,i),1));
- }
- int ans = 0;
- for(int i=0;i<n*2;i++){
- if(done[v[i].first.second])continue;
- if(v[i].second){
- if(k==0)continue;
- k--;
- }
- if(m < v[i].first.first)break;
- ans++;
- m -= v[i].first.first;
- done[v[i].first.second] = 1;
- }
- cout<<ans<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment