oj.uz

Submission #209256

# Submission time Handle Problem Language Result Execution time Memory
209256 2020-03-13T14:00:02 Z Autoratch Exhibition (JOI19_ho_t2) C++14
0 / 100
 5 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5;

int n,m;
pair<long long,long long> a[N];
long long b[N],ans;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for(int i = 0;i < n;i++) cin >> a[i].second >> a[i].first;
    for(int i = 0;i < m;i++) cin >> b[i];
    sort(a,a+n),sort(b,b+m);
    int i = 0,j = 0;
    while(j<m)
    {
        if(b[j]>=a[i].second) ans++,i++,j++;
        else j++;
    }
    cout << ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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