| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 106790 | FiloSanza | Exhibition (JOI19_ho_t2) | C++14 | 83 ms | 4600 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(){
cin.tie(0);
cin.sync_with_stdio(0);
int N, M;
cin >> N >> M;
vector<pair<int, int>> v(N);
vector<int> f(M);
for(auto &i : v) cin >> i.second >> i.first;
for(auto &i : f) cin >> i;
sort(v.begin(), v.end());
sort(f.begin(), f.end());
int ans = 0;
for(int i=N-1; i>=0 && ans<M; i--){
if(v[i].second <= f[M-1-ans])
ans++;
}
cout << ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
