#904774 (C++23) No.2424 Josouzai

• 問題: No.2424 Josouzai
• ユーザー: sgfc
• 提出日時: 2023-08-18 21:03:12
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 37 ms / 2,000 ms
• コード長: 3,071 bytes
• コンパイル時間: 5,477 ms
• コンパイル使用メモリ: 315,912 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-06 02:29:34
• 合計ジャッジ時間: 6,607 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	10 ms; 5,376 KB
testcase_05	AC	35 ms; 5,376 KB
testcase_06	AC	35 ms; 5,376 KB
testcase_07	AC	35 ms; 5,376 KB
testcase_08	AC	37 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	8 ms; 5,376 KB
testcase_11	AC	19 ms; 5,376 KB
testcase_12	AC	15 ms; 5,376 KB
testcase_13	AC	13 ms; 5,376 KB
testcase_14	AC	20 ms; 5,376 KB
testcase_15	AC	4 ms; 5,376 KB
testcase_16	AC	30 ms; 5,376 KB
testcase_17	AC	8 ms; 5,376 KB
testcase_18	AC	9 ms; 5,376 KB
testcase_19	AC	17 ms; 5,376 KB
testcase_20	AC	31 ms; 5,376 KB
testcase_21	AC	24 ms; 5,376 KB
testcase_22	AC	11 ms; 5,376 KB
testcase_23	AC	13 ms; 5,376 KB
testcase_24	AC	7 ms; 5,376 KB
testcase_25	AC	33 ms; 5,376 KB
testcase_26	AC	22 ms; 5,376 KB
testcase_27	AC	33 ms; 5,376 KB
testcase_28	AC	30 ms; 5,376 KB
testcase_29	AC	26 ms; 5,376 KB
testcase_30	AC	7 ms; 5,376 KB
testcase_31	AC	16 ms; 5,376 KB
testcase_32	AC	33 ms; 5,376 KB

ソースコード

#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>

#include <stdio.h>
#include <math.h>
#include <cassert>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

#include <float.h>


//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>;
using vvm = vector<vm>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);


	ll n, k;
	cin >> n >> k;

	VLI(a, n);
	mysort(a);

	ll ans = 0;
	REP(i, n) {
		if (a[i] <= k) {
			ans++;
			k -= a[i];
		}
	}

	cout << ans << " " << k << endl;

	return 0;
}