| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1041201 | dpsaveslives | Exhibition (JOI19_ho_t2) | C++17 | 0 ms | 348 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>
#define f first
#define s second
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N,M; cin >> N >> M;
vector<pair<int,int>> pictures(N);
for(int i = 0;i<N;++i){
cin >> pictures[i].s >> pictures[i].f;
}
sort(pictures.begin(),pictures.end());
vector<int> frames(M);
for(int i = 0;i<M;++i){
cin >> frames[i];
}
sort(frames.begin(),frames.end());
int i = 0, j = 0, ans = 0;
while(i < N && j < M){
while(j < M && pictures[i].s > frames[j]){
++j;
}
if(j < M) ++ans;
++i; ++j;
}
cout << ans << "\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... | ||||
