oj.uz

Submission #916516

# Submission time Handle Problem Language Result Execution time Memory
916516 2024-01-26T03:31:34 Z Aiperiii Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
signed main(){
   int n,m;
   cin>>n>>m;
   vector < pair <int,int> >  v;
   for(int i=0;i<n;i++){
      int x,y;
      cin>>x>>y;
      v.pb({y,x});
   }
   sort(all(v));
   vector <int> c(m);
   for(int i=0;i<m;i++){
      cin>>c[i];
   }
   sort(all(c));
   
   vector <int >pos;
   for(int i=0;i<n;i++){
      auto x=lower_bound(all(c),v[i].ss)-c.begin();
      pos.pb(x);
   }
   int p=-1,cnt=0;
   for(auto i : pos){
      if(p==m-1)break;
      if(i>=m)continue;
      p=max(p+1,i);
      cnt++;
   }
   cout<<cnt<<"\n";
}

/*
 
 */

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -