結果
問題 | No.2424 Josouzai |
ユーザー |
![]() |
提出日時 | 2023-08-18 21:07:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 101 ms / 2,000 ms |
コード長 | 2,949 bytes |
コンパイル時間 | 2,178 ms |
コンパイル使用メモリ | 199,168 KB |
最終ジャッジ日時 | 2025-02-16 09:15:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
#line 1 "playspace/main.cpp" #include <bits/stdc++.h> #line 8 "library/gandalfr/other/io_supporter.hpp" template <typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != (int)v.size() ? " " : ""); return os; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &st) { for (const T &x : st) { std::cout << x << " "; } return os; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &st) { for (const T &x : st) { std::cout << x << " "; } return os; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &dq) { for (const T &x : dq) { std::cout << x << " "; } return os; } template <typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) { os << p.first << ' ' << p.second; return os; } template <typename T> std::ostream &operator<<(std::ostream &os, std::queue<T> &q) { int sz = q.size(); while (--sz) { os << q.front() << ' '; q.push(q.front()); q.pop(); } os << q.front(); q.push(q.front()); q.pop(); return os; } template <typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &in : v) is >> in; return is; } template <typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) { is >> p.first >> p.second; return is; } #line 3 "playspace/main.cpp" using namespace std; using ll = long long; const int INF = 1001001001; const int MAXINT = std::numeric_limits<int>::max(); const int MININT = std::numeric_limits<int>::min(); const ll INFLL = 1001001001001001001; const ll MAXLL = std::numeric_limits<ll>::max(); const ll MINLL = std::numeric_limits<ll>::min(); const ll MOD = 1000000007; const ll _MOD = 998244353; #define rep(i, j, n) for(ll i = (ll)(j); i < (ll)(n); i++) #define rrep(i, j, n) for(ll i = (ll)(n-1); i >= (ll)(j); i--) #define all(a) (a).begin(),(a).end() #define LF cout << endl #ifdef ENABLE_MULTI_FOR #define mrep(it, mr) for(multi_iter it(mr); !it.fin(); ++it) #endif template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } void Yes(bool ok){ std::cout << (ok ? "Yes" : "No") << std::endl; } int main(void){ ll N, K; cin >> N >> K; using pi = pair<ll, int>; priority_queue<pi,vector<pi>,greater<pi>> q; rep(i,0,N) { int a; cin >> a; q.push({a, i+1}); } vector<int> ans; while(!q.empty() && K - q.top().first >= 0) { K -= q.top().first; ans.push_back(q.top().second); q.pop(); } cout << ans.size() << " " << K << endl; }