eolymp
bolt
Try our new interface for solving problems
Məsələlər

Васька за границей

dərc olunub 12.02.24 10:39:58

include <iostream>

include <cmath>

include <iomanip>

include <algorithm>

using namespace std; int main() { long long n,m,s,k,w; cin>>n>>m; long long f[n],mn,mx; for(int i=0;i<n;i++) { cin>>f[i]; } sort(f,f+n); w=n; for (int i=n-1;i>=0;i--) { s=0; k=0; for(int j=i;j>=0;j--) { if(s+f[j]==m) { w=min(w,k+1); } else if(s+f[j]<m) { s+=f[j]; k++; } } } if(w==n) { cout<<0; } else { cout<<w; } }