#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define cd complex<double>
#define p_q priority_queue
using namespace std;
int main(){
AquA;
int n,m;
cin >> n >> m;
vector<pair<int,int> > v(n);
vector<int> p(m);
for(int i=0;i<n;i++){
cin >> v[i].fs >> v[i].sc;
}
sort(v.begin(),v.end());
for(int i=0;i<m;i++){
cin >> p[i];
}
sort(p.begin(),p.end());
int nw=0;
vector<pair<int,int> > z;
int ans=0;
for(int i=0;i<n;i++){
while(nw<m && p[nw]<v[i].fs){
nw++;
}
if(nw==m){
break;
}
//cout << nw << " " << p[nw] << endl;
auto h=upper_bound(z.begin(),z.end(),pair<int,int>(v[i].sc,-1))-z.begin();
int a=h==0?0:max(z[h-1].sc+1,nw);
//cout << a << endl;
if(a>=m){
break;
}
if(h==z.size()){
z.push_back({v[i].sc,a});
}
else{
z[h].fs=v[i].sc;
z[h].sc=a;
}
//cout << v[i].sc << endl;
//nw++;
}
cout << z.size() << "\n";
return 0;
}
Compilation message
joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:42:7: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | if(h==z.size()){
| ~^~~~~~~~~~
joi2019_ho_t2.cpp:27:6: warning: unused variable 'ans' [-Wunused-variable]
27 | int ans=0;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |