oj.uz

Submission #481169

# Submission time Handle Problem Language Result Execution time Memory
481169 2021-10-19T16:54:42 Z Lobo Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
 
using namespace std;

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 100010

ii n, m, c[maxn];
pair<ii,ii> p[maxn];
int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    cin >> n >> m;

    for(ii i = 1; i <= n; i++) {
        cin >> p[i].sc >> p[i].fr;
    }

    for(ii i = 1; i <= m; i++) {
        cin >> c[i];
    }

    sort(p+1,p+1+n);
    sort(c+1,c+1+m);

    ii p1 = 1;
    ii p2 = 1;

    ii ans = 0;
    while(p1 <= n && p2 <= m) {
        if(p[p1].sc <= c[p2]) {
            ans++;
            p1++;
            p2++;
        }
        else {
            p2++;
        }
    }

    cout << ans << endl;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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