| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 234095 | super_j6 | Exhibition (JOI19_ho_t2) | C++14 | 5 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int maxn = 100000;
int n, m;
pi a[maxn];
int b[maxn];
vector<int> v;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> a[i].s >> a[i].f;
for(int i = 0; i < m; i++) cin >> b[i];
sort(a, a + n, greater<pi>());
sort(b, b + m, greater<int>());
for(int i = 0; i < n; i++){
int it = upper_bound(v.begin(), v.end(), a[i].s, greater<int>()) - v.begin();
if(it >= m || a[i].s > b[it]) continue;
if(it < v.size()) v[it] = a[i].s;
else v.push_back(a[i].s);
}
cout << v.size() << endl;
return 0;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
