oj.uz

Submission #1115601

# Submission time Handle Problem Language Result Execution time Memory
1115601 2024-11-20T16:49:46 Z ljtunas Gym Badges (NOI22_gymbadges) C++14
24 / 100
 140 ms 25536 KB 
// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 5e5 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e18;

//#define int long long

int n; array<ll, 3> a[MAXN];

void Solve() {
    cin >> n;
    For(i, 1, n) cin >> a[i][2];
    For(i, 1, n) cin >> a[i][1];
    For(i, 1, n) a[i][0] = a[i][1] + a[i][2];
    sort(a + 1, a + n + 1);
    priority_queue<ll> pq;
    ll sum = 0; int ans = 0;
    For(i, 1, n) {
        if (sum <= a[i][1]){
            sum += a[i][2];
            ++ans;
            pq.push(a[i][2]);
        } else if(pq.size() && pq.top() > a[i][2]){
            sum -= pq.top();
            pq.pop();
            sum += a[i][2];
        }
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("a.inp", "r")) {
        freopen("a.inp", "r", stdin);
        freopen("a.out", "w", stdout);
    }

    int t = 1;
//    cin >> t;
    while(t --) Solve();

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen("a.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp:66:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         freopen("a.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 336 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 18636 KB Output is correct
2 Correct 140 ms 19520 KB Output is correct
3 Correct 117 ms 19528 KB Output is correct
4 Correct 118 ms 21076 KB Output is correct
5 Correct 120 ms 19652 KB Output is correct
6 Correct 119 ms 16844 KB Output is correct
7 Correct 114 ms 19816 KB Output is correct
8 Correct 116 ms 18880 KB Output is correct
9 Correct 122 ms 19184 KB Output is correct
10 Correct 116 ms 16824 KB Output is correct
11 Correct 131 ms 22656 KB Output is correct
12 Correct 117 ms 24328 KB Output is correct
13 Correct 116 ms 18992 KB Output is correct
14 Correct 113 ms 25536 KB Output is correct
15 Correct 111 ms 22208 KB Output is correct
16 Correct 126 ms 17300 KB Output is correct
17 Correct 118 ms 17316 KB Output is correct
18 Correct 116 ms 17352 KB Output is correct
19 Correct 112 ms 16888 KB Output is correct
20 Correct 118 ms 16844 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Incorrect 2 ms 760 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 120 ms 18636 KB Output is correct
22 Correct 140 ms 19520 KB Output is correct
23 Correct 117 ms 19528 KB Output is correct
24 Correct 118 ms 21076 KB Output is correct
25 Correct 120 ms 19652 KB Output is correct
26 Correct 119 ms 16844 KB Output is correct
27 Correct 114 ms 19816 KB Output is correct
28 Correct 116 ms 18880 KB Output is correct
29 Correct 122 ms 19184 KB Output is correct
30 Correct 116 ms 16824 KB Output is correct
31 Correct 131 ms 22656 KB Output is correct
32 Correct 117 ms 24328 KB Output is correct
33 Correct 116 ms 18992 KB Output is correct
34 Correct 113 ms 25536 KB Output is correct
35 Correct 111 ms 22208 KB Output is correct
36 Correct 126 ms 17300 KB Output is correct
37 Correct 118 ms 17316 KB Output is correct
38 Correct 116 ms 17352 KB Output is correct
39 Correct 112 ms 16888 KB Output is correct
40 Correct 118 ms 16844 KB Output is correct
41 Incorrect 2 ms 760 KB Output isn't correct
42 Halted 0 ms 0 KB -