oj.uz

Submission #505868

# Submission time Handle Problem Language Result Execution time Memory
505868 2022-01-11T09:09:12 Z Carmel_Ab1 King of Chairs (FXCUP4_chairs) C++17
0 / 100
 54 ms 7816 KB 
#include "king.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;

ll SendInfo(vi W, vi C) {
    multiset<int>s;
    int n=C.size();
    for(int i=0; i<n; i++)
        s.insert(C[i]);

    int ans=0;
    for(int i=0; i<n; i++){
        auto it=s.lower_bound(W[i]);
        if(it==s.end())break;
        s.erase(it);
        ans++;
    }
    return ans;
}

#include "vassal.h"


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int>pi;
int pref=0;
multiset<pi>s;

void Init(ll B, vi C){
    pref=B;
    int n=C.size();
    for(int i=0; i<n; i++)
        s.insert({C[i],i});
}

int Maid(int W){
    if(!pref)return -1;
    if(W>=s.rbegin()->first)return -1;
    pref--;
    int ans=s.rbegin()->second;
    s.erase(s.find(*s.rbegin()));
    return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 484 KB Correct
2 Correct 0 ms 484 KB Correct
3 Incorrect 0 ms 492 KB Wrong
4 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 7784 KB Wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 7816 KB Wrong
2 Halted 0 ms 0 KB -