oj.uz

Submission #1041201

# Submission time Handle Problem Language Result Execution time Memory
1041201 2024-08-01T17:39:34 Z dpsaveslives Exhibition (JOI19_ho_t2) C++17
0 / 100
 0 ms 348 KB 
#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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -