DMOJ · ampl2023practicep3

Demo Day Demos

This C++ solution uses sorting & greedy for DMOJ ampl2023practicep3 Demo Day Demos. Read the reasoning, inspect the code, or try your own test case below.

ampl2023practicep3Sorting & searchingSorting & greedyC++22 lines
Solution073of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

Demo Day Demos asks for the maximum number of durations fitting within K; the code sorts durations and greedily buys the shortest.

Sorting & searching

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

Problem_3_Demo_Day_Demos.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; ll k; cin >> n >> k;
        vector<ll>v(n);
        for (int i = 0; i < n; i++) cin >> v[i];
        sort(v.begin(), v.end());
        ll cnt = 0;
        for (int i = 0; i < v.size(); i++) {
            if (k >= v[i]) {
                k -= v[i];
                cnt++;
            }
        }
        cout << cnt << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.