# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199768 | Mercenary | Exhibition (JOI19_ho_t2) | C++14 | 77 ms | 4608 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 pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int maxn = 1e5 + 5;
ii a[maxn];
int b[maxn];
int n , m;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP","r")){
freopen(taskname".INP", "r",stdin);
freopen(taskname".OUT", "w",stdout);
}
cin >> n >> m;
for(int i = 1 ; i <= n ; ++i)cin >> a[i].second >> a[i].first;
for(int i = 1 ; i <= m ; ++i)cin >> b[i];
sort(a + 1 , a + n + 1,greater<ii>());
sort(b + 1 , b + m + 1,greater<int>());
int j = 1;
int res = 0;
for(int i = 1 ; i <= m ; ++i){
while(j <= n && a[j].second > b[i])++j;
if(j > n)break;
++j;
res++;
}
cout << res;
}
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... |