| 提出番号 | 1722 |
|---|---|
| 提出者 | aaabbbcccddd |
| 言語 | C++ |
| 提出日時 | 2018-08-04 13:38:25 |
| 問題名 | (68)単位 |
| 結果 | AC |
| 点数 | 100% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | AC | 100% | 3ms | 7968KB |
| 2 | AC | 100% | 2ms | 7920KB |
| 3 | AC | 100% | 2ms | 8176KB |
| 4 | AC | 100% | 2ms | 8704KB |
| 5 | AC | 100% | 2ms | 7648KB |
| 6 | AC | 100% | 1ms | 8400KB |
| 7 | AC | 100% | 2ms | 8720KB |
| 8 | AC | 100% | 2ms | 7984KB |
| 9 | AC | 100% | 1ms | 8720KB |
| 10 | AC | 100% | 2ms | 8448KB |
| 11 | AC | 100% | 2ms | 8432KB |
| 12 | AC | 100% | 1ms | 8368KB |
| 13 | AC | 100% | 2ms | 8336KB |
| 14 | AC | 100% | 2ms | 7984KB |
| 15 | AC | 100% | 2ms | 7792KB |
| 16 | AC | 100% | 2ms | 8416KB |
| 17 | AC | 100% | 2ms | 8416KB |
| 18 | AC | 100% | 2ms | 8432KB |
| 19 | AC | 100% | 2ms | 7792KB |
| 20 | AC | 100% | 2ms | 8480KB |
| 21 | AC | 100% | 1ms | 8240KB |
| 22 | AC | 100% | 2ms | 8432KB |
| 23 | AC | 100% | 1ms | 8736KB |
| 24 | AC | 100% | 1ms | 8352KB |
| 25 | AC | 100% | 2ms | 7904KB |
| 26 | AC | 100% | 2ms | 8432KB |
| 27 | AC | 100% | 2ms | 8384KB |
| 28 | AC | 100% | 2ms | 8160KB |
| 29 | AC | 100% | 2ms | 8688KB |
| 30 | AC | 100% | 2ms | 8672KB |
| 31 | AC | 100% | 2ms | 7792KB |
| 32 | AC | 100% | 2ms | 7648KB |
| 33 | AC | 100% | 2ms | 8720KB |
| 34 | AC | 100% | 2ms | 8000KB |
| 35 | AC | 100% | 2ms | 8016KB |
| 36 | AC | 100% | 2ms | 8320KB |
| 37 | AC | 100% | 2ms | 8432KB |
| 38 | AC | 100% | 2ms | 8720KB |
| 39 | AC | 100% | 1ms | 8400KB |
| 40 | AC | 100% | 2ms | 7632KB |
| 41 | AC | 100% | 1ms | 8080KB |
| 42 | AC | 100% | 2ms | 8720KB |
| 43 | AC | 100% | 2ms | 8656KB |
| 44 | AC | 100% | 2ms | 7552KB |
| 45 | AC | 100% | 2ms | 8400KB |
| 46 | AC | 100% | 2ms | 8448KB |
| 47 | AC | 100% | 2ms | 7888KB |
| 48 | AC | 100% | 2ms | 8176KB |
| 49 | AC | 100% | 2ms | 7520KB |
| 50 | AC | 100% | 2ms | 8080KB |
| 51 | AC | 100% | 2ms | 8064KB |
| 52 | AC | 100% | 2ms | 7632KB |
| 53 | AC | 100% | 2ms | 8016KB |
| 54 | AC | 100% | 1ms | 8352KB |
| 55 | AC | 100% | 2ms | 7536KB |
| 56 | AC | 100% | 2ms | 8128KB |
| 57 | AC | 100% | 2ms | 8064KB |
| 58 | AC | 100% | 2ms | 8432KB |
| 59 | AC | 100% | 2ms | 7792KB |
| 60 | AC | 100% | 2ms | 7648KB |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int N, M;
int A[110];
signed main() {
cin >> N >> M;
rep(i, N) {
cin >> A[i];
}
sort(A, A + N, greater<int>());
int t = 0;
if (M == 0) {
cout << 0 << endl;
return 0;
}
rep(i, N) {
t += A[i];
if (t >= M) {
cout << i + 1 << endl;
return 0;
}
}
}