| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 372479 | mariowong | Exhibition (JOI19_ho_t2) | C++14 | 1 ms | 384 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;
long long n,m,pt,b[100005];
pair<long long,long long> a[100005];
int main(){
ios::sync_with_stdio(false);
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+1+n); pt=n+1; sort(b+1,b+1+m);
for (int i=m;i>=1;i--){
if (pt-1 && a[pt-1].second <= b[i])
pt--;
}
cout << n-pt+1 << "\n";
return 0;
} | # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
