Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("suma.in");
- int n, S, arr[1001], cnt, minp, sp, poz;
- int main()
- {
- cin>>n>>S;
- for(int i=1; i<=n; ++i)
- cin>>arr[i];
- sort(arr+1,arr+n+1);
- int i=1;
- while(sp+arr[i]<=S && i<=n)
- {
- if(sp+arr[i]<=S)
- {
- sp+=arr[i];
- cnt++;
- poz=i;
- }
- else
- break;
- ++i;
- }
- if(sp<S)
- {
- S=S-sp;
- if(poz+1<=n)
- minp=arr[poz+1]-S;
- }
- else if(sp>S)
- {
- cnt--;
- poz--;
- if(poz<=n)
- minp=sp-S;
- }
- else if(sp==S)
- if(poz+1<=n)
- minp=arr[poz+1];
- cout<<cnt<<" "<<minp<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement