oj.uz

Submission #83636

# Submission time Handle Problem Language Result Execution time Memory
83636 2018-11-09T14:12:22 Z Leonardo_Paes Kralj (COCI16_kralj) C++11
56 / 140
 297 ms 4668 KB 
#include <bits/stdc++.h>

using namespace std;

#define MAXN 500100

int d[MAXN], e[MAXN];

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

    int n, a, resp=0;

    cin >> n;

    for(int i=1; i<=n; i++){
        cin >> a;
    }
    for(int i=1; i<=n; i++){
        cin>>d[i];
    }
    for(int i=1; i<=n; i++){
        cin>>e[i];
    }
    sort(d+1, d+n+1);
    sort(e+1, e+n+1);

    for(int i=1, j=1; i<=n; i++){
        if(e[i]>d[j]){
            resp++;
            j++;
            continue;
        }
    }

    cout << resp << endl;
    return 0;
}

Subtask #1
56.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 3580 KB Output is correct
2 Correct 195 ms 3580 KB Output is correct
3 Correct 252 ms 4288 KB Output is correct
4 Correct 261 ms 4312 KB Output is correct
5 Incorrect 252 ms 4312 KB Output isn't correct
6 Incorrect 253 ms 4312 KB Output isn't correct
7 Incorrect 297 ms 4312 KB Output isn't correct
8 Incorrect 260 ms 4312 KB Output isn't correct
9 Incorrect 286 ms 4616 KB Output isn't correct
10 Incorrect 267 ms 4668 KB Output isn't correct