| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 768123 | LinkedArray | Exhibition (JOI19_ho_t2) | C++17 | 1 ms | 212 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 n, m;
cin>>n>>m;
vector<pair<int, int>> picture(n);
vector<int> frame(m);
for(auto &[a, b] : picture){
cin >> a >> b;
}
for(auto &a : frame){
cin >> a;
}
sort(picture.begin(), picture.end());
sort(frame.begin(), frame.end());
int ans = 0, j = m-1;
int i = n - 1;
while(i >= 0){
if(picture[i].first <= frame[j]){
++ans;
j--;
}
i--;
}
cout << ans << endl;
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... | ||||
