# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97407 | MatheusLealV | Exhibition (JOI19_ho_t2) | C++17 | 79 ms | 1656 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 N 100050
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
pii p[N];
int n, m, c[N], ans;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n>>m;
for(int i = 1; i <= n; i++) cin>>p[i].s>>p[i].f;
for(int i = 1; i <= m; i++) cin>>c[i];
sort(c + 1, c + m + 1);
sort(p + 1, p + n + 1);
int j = n, resp = 0;
for(int i = m; i >= 1; i--)
{
while(p[j].s > c[i] and j >= 1) j --;
if(j >= 1) ans ++, j --;
}
cout<<ans<<"\n";
}
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... |