# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158954 | aguss | Kralj (COCI16_kralj) | C++20 | 656 ms | 27840 KiB |
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ": " << x << '\n';
#define dbgv(v) cerr << #v << ": "; for(auto &el : v) cerr << el << " "; cerr << '\n';
using namespace std;
using ll = long long;
bool test_cases = 0;
void solve(){
int n;
cin >> n;
vector<int> a(n), a1(n);
multiset<int> a2;
for(int &i : a){
cin >> i;
}
for(int &i : a1){
cin >> i;
}
for(int i = 0; i < n; i++){
int aux;
cin >> aux;
a2.insert(aux);
}
int ans = 0;
for(int i = 0; i < n; i++){
multiset<int>::iterator x = a2.lower_bound(a1[i]);
if(x != a2.end() and *x > a1[i]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |