Submission #757990

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
757990	2023-06-14 04:15:22	Dexva	Gym Badges (NOI22_gymbadges)	C++14	0 / 100	2069 ms	16452 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define lln long long
void solve() {
    lln n; cin >> n;
    lln gain[n], cap[n];
    for (lln i=0;i<n;i++) cin >> gain[i];
    for (lln i=0;i<n;i++) cin >> cap[i];
    lln ans = 0;
    vector<pair<lln,lln> > gyms; //gain, cap
    for (lln i=0;i<n;i++) gyms.push_back(make_pair(gain[i], cap[i]));
    sort(gyms.begin(),gyms.end());
    // for (lln i=0;i<n;i++) cout << get<0>(gyms[i]) << " " << get<1>(gyms[i]) << '\n';
    for (lln t=0;t<n;t++) {
        lln level = 0, badges = 0; 
        for (lln i=0;i<n;i++) {
            if (i==t) continue;
            // cout << t << " " << i << " " << level << '\n';
            if ((level+get<0>(gyms[i])) <= get<1>(gyms[t]) && level <= get<1>(gyms[i])) {
                // cout << "yes " << i << " " << t << '\n';
                level += get<0>(gyms[i]);
                badges++;
            }
        } 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 15
• Subtask 2: 0 / 9
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49