oj.uz

Submission #1091727

# Submission time Handle Problem Language Result Execution time Memory
1091727 2024-09-22T00:58:37 Z BlueGlaucus1 Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 348 KB 
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int n,m; cin >> n >> m;
    pair<int, int> paint[n];
    int frame[m];
    for(int i =0; i <n;i++){
        cin >> paint[i].second >> paint[i].first;
    }
    for(int i = 0; i <m;i++){
        cin >> frame[i];
    }
    sort(paint, paint+n);
    sort(frame, frame+m);
    int frame_ind = 0;
    int answer = 0;
    for(int i = 0; i <n;i++){
        int size = paint[i].second;
        while(frame_ind < n && frame[frame_ind] < size){
            frame_ind++;
        }
        if(frame_ind==n){
            cout << answer <<'\n';
            return 0;
        }
        frame_ind+=1;
        answer +=1;
    }
    cout << answer <<'\n';
    return 0 ;

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 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 344 KB Output is correct
2 Correct 1 ms 344 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 344 KB Output is correct
2 Correct 1 ms 344 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 -