-
Notifications
You must be signed in to change notification settings - Fork 10
/
DTDOI.cpp
60 lines (47 loc) 路 1.09 KB
/
DTDOI.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FOD(i,r,l) for (int i=r;i>=l;i--)
#define fillchar(a,x) memset(a, x, sizeof (a))
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N = 1000000;
const int inf = 1e9;
int n, s, a[150], F[N+1], ans;
int main() {
// freopen("INP.TXT", "r", stdin);
// freopen("OUT.TXT", "w", stdout);
scanf("%d%d", &n, &s);
FOR(i,1,n) scanf("%d", &a[i]);
sort(a+1, a+n+1);
FOR(i,1,N/n) {
F[i] = inf;
FOR(j,1,n)
if (a[j] <= i)
F[i] = min(F[i], 1 + F[i-a[j]]);
else break;
}
if (s <= N/n) {
printf("%d\n", F[s]);
return 0;
}
ans = inf;
int time = 0;
for (int cnt = s / a[n]; cnt > 0; cnt--) {
int t = s - a[n] * cnt;
if (t > N/n || time > N) break;
ans = min(ans, cnt + F[t]);
time++;
}
printf("%d\n", ans);
return 0;
}