oj.uz

Submission #770074

# Submission time Handle Problem Language Result Execution time Memory
770074 2023-06-30T18:04:34 Z raysh07 None (JOI14_ho_t2) C++17
100 / 100
 7 ms 520 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n, m; cin >> m >> n;
    
    vector <int> dp(m + 1, INF);
    dp[0] = 0;
    vector <int> p(m);
    for (auto &x : p) cin >> x;
    
    sort(p.begin(), p.end(), greater<int>());
    
    while (n--){
        int c, e; cin >> c >> e;
        
        for (int j = m; j >= 1; j--){
            int go = max(0LL, j - c);
            
            dp[j] = min(dp[j], dp[go] + e);
        }
    }
    
    int curr = 0;
    int ans = 0;
    int cnt = 0;
    for (auto x : p){
        curr += x;
        cnt++;
        
       // cout << curr << " " << cnt << " " << dp[cnt] << "\n";
        
        ans = max(ans, curr - dp[cnt]);
    }
    
    cout << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 508 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 6 ms 468 KB Output is correct
4 Correct 7 ms 488 KB Output is correct
5 Correct 6 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 476 KB Output is correct
8 Correct 6 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 6 ms 468 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 6 ms 508 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 7 ms 488 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 5 ms 476 KB Output is correct
18 Correct 6 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 6 ms 484 KB Output is correct
23 Correct 6 ms 520 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 468 KB Output is correct
26 Correct 6 ms 468 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 6 ms 468 KB Output is correct
29 Correct 6 ms 504 KB Output is correct
30 Correct 6 ms 468 KB Output is correct