# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127596 | arnold518 | Exhibition (JOI19_ho_t2) | C++14 | 94 ms | 4984 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>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
int N, M;
pii V[MAXN+10];
int S[MAXN+10], C[MAXN+10];
int ans;
int main()
{
int i, j;
scanf("%d%d", &N, &M);
for(i=1; i<=N; i++) scanf("%d%d", &V[i].second, &V[i].first);
for(i=1; i<=M; i++) scanf("%d", &C[i]);
sort(V+1, V+N+1);
sort(C+1, C+M+1);
for(i=1; i<=N; i++) S[i]=V[i].second;
for(i=N, j=M; i>=1 && j>=1;)
{
if(C[j]<S[i]) i--;
else i--, j--, ans++;
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... |