# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136750 | ekrem | Exhibition (JOI19_ho_t2) | C++98 | 2 ms | 376 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 <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define coc g[node][i]
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)>>1)
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;
typedef long long ll;
typedef pair < int , int > ii;
int n, m, ind = 1, k, a[N], c[N];
ii b[N];
multiset < int > s;
int main(){
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d %d",&n ,&m);
for(int i = 1; i <= n; i++)
scanf("%d %d",&b[i].st ,&b[i].nd);
sort(b + 1, b + n + 1);
for(int i = 1; i <= m; i++)
scanf("%d",a + i);
sort(a + 1, a + m + 1);
for(int i = 1; i <= m; i++){
while(ind <= n and b[ind].st <= a[i]){
s.insert(b[ind].nd);
ind++;
}
if(!s.empty()){
int ek = *s.begin();
int ind = upper_bound(c + 1, c + k + 1, ek) - c;
// cout << ek << " " << ind << endl;
if(ind > k)
k++;
c[ind] = ek;
s.erase(s.find(ek));
}
}
printf("%d\n", k);
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... |