Submission #673981

#	Time	Username	Problem	Language	Result	Execution time	Memory
673981		Victor	Akcija (COCI21_akcija)	C++17	30 / 110	2 ms	380 KiB

Main

// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define debug(x) cout<<#x<<" = "<<x<<endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n,k;
    cin>>n>>k;
    vii products(n);

    rep(i,0,n) cin>>products[i].first>>products[i].second;

    sort(all(products));
    int cnt=0;
    ll sum=0;
    vector<bool> taken(n,0);
    trav(product,products) {
        int cost,deadline;
        tie(cost,deadline)=product;
        per(i,0,deadline) if(taken[i]==0) {
            taken[i]=1;
            ++cnt;
            sum+=cost;
            break;
        } 
    }   

    cout<<cnt<<' '<<sum<<endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 30
• Subtask 6: 0 / 20