| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 129385 | ntrung03 | Exhibition (JOI19_ho_t2) | C++17 | 250 ms | 1672 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;
int main(int argc, char *argv[]) {
int n,m;
cin>>n>>m;
vector<pair<int,int>> p(n);
for(auto&p:p) cin>>p.second>>p.first;
sort(p.begin(),p.end());
vector<int> fr(m);
for(auto&fr:fr) cin>>fr;
sort(fr.begin(),fr.end());
auto frp = fr.rbegin();
int res =0;
for(auto it=p.rbegin();it!=p.rend()&&frp!=fr.rend();it++){
if(*frp>=it->second){
res++;
frp++;
}
}
cout<<res<<endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
