| 提出番号 | 1490 |
|---|---|
| 提出者 | amano |
| 言語 | C++ |
| 提出日時 | 2018-08-04 13:04:19 |
| 問題名 | (68)単位 |
| 結果 | AC |
| 点数 | 100% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | AC | 100% | 2ms | 8176KB |
| 2 | AC | 100% | 2ms | 8096KB |
| 3 | AC | 100% | 2ms | 8448KB |
| 4 | AC | 100% | 1ms | 8672KB |
| 5 | AC | 100% | 2ms | 8064KB |
| 6 | AC | 100% | 2ms | 8384KB |
| 7 | AC | 100% | 2ms | 8288KB |
| 8 | AC | 100% | 2ms | 8416KB |
| 9 | AC | 100% | 2ms | 8048KB |
| 10 | AC | 100% | 1ms | 8304KB |
| 11 | AC | 100% | 2ms | 7248KB |
| 12 | AC | 100% | 2ms | 8016KB |
| 13 | AC | 100% | 2ms | 8000KB |
| 14 | AC | 100% | 1ms | 7504KB |
| 15 | AC | 100% | 2ms | 8592KB |
| 16 | AC | 100% | 2ms | 8448KB |
| 17 | AC | 100% | 2ms | 7504KB |
| 18 | AC | 100% | 1ms | 7824KB |
| 19 | AC | 100% | 2ms | 8400KB |
| 20 | AC | 100% | 2ms | 7888KB |
| 21 | AC | 100% | 2ms | 7552KB |
| 22 | AC | 100% | 2ms | 7648KB |
| 23 | AC | 100% | 2ms | 8400KB |
| 24 | AC | 100% | 2ms | 8704KB |
| 25 | AC | 100% | 2ms | 7792KB |
| 26 | AC | 100% | 2ms | 7600KB |
| 27 | AC | 100% | 2ms | 7632KB |
| 28 | AC | 100% | 2ms | 8432KB |
| 29 | AC | 100% | 2ms | 8400KB |
| 30 | AC | 100% | 2ms | 7248KB |
| 31 | AC | 100% | 1ms | 8720KB |
| 32 | AC | 100% | 2ms | 8720KB |
| 33 | AC | 100% | 2ms | 8416KB |
| 34 | AC | 100% | 2ms | 8320KB |
| 35 | AC | 100% | 2ms | 7536KB |
| 36 | AC | 100% | 2ms | 8432KB |
| 37 | AC | 100% | 2ms | 8448KB |
| 38 | AC | 100% | 2ms | 7648KB |
| 39 | AC | 100% | 1ms | 8720KB |
| 40 | AC | 100% | 2ms | 7232KB |
| 41 | AC | 100% | 1ms | 7824KB |
| 42 | AC | 100% | 2ms | 8144KB |
| 43 | AC | 100% | 2ms | 8016KB |
| 44 | AC | 100% | 2ms | 8064KB |
| 45 | AC | 100% | 2ms | 8560KB |
| 46 | AC | 100% | 2ms | 8704KB |
| 47 | AC | 100% | 2ms | 8384KB |
| 48 | AC | 100% | 2ms | 8384KB |
| 49 | AC | 100% | 2ms | 7520KB |
| 50 | AC | 100% | 2ms | 7760KB |
| 51 | AC | 100% | 2ms | 8128KB |
| 52 | AC | 100% | 2ms | 7792KB |
| 53 | AC | 100% | 2ms | 8304KB |
| 54 | AC | 100% | 2ms | 7248KB |
| 55 | AC | 100% | 2ms | 8448KB |
| 56 | AC | 100% | 2ms | 8272KB |
| 57 | AC | 100% | 1ms | 8256KB |
| 58 | AC | 100% | 2ms | 7776KB |
| 59 | AC | 100% | 2ms | 8064KB |
| 60 | AC | 100% | 2ms | 7536KB |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
for (auto &i : v) is >> i;
return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
const string delimiter = "\n";
REP(i, v.size())
{
os << v[i];
if (i != v.size() - 1) os << delimiter;
}
return os;
}
/*--------------------template--------------------*/
int main()
{
cin.sync_with_stdio(false); cout << fixed << setprecision(10);
int n, m; cin >> n >> m;
vi a(n); cin >> a;
sort(a.rbegin(), a.rend());
int ans = 0;
int sum = 0;
int i = 0;
while (sum < m)
{
ans++;
sum += a[i];
i++;
}
cout << ans << endl;
return 0;
}