oj.uz

Submission #133803

# Submission time Handle Problem Language Result Execution time Memory
133803 2019-07-21T11:53:44 Z tdwn Kralj (COCI16_kralj) C++17
42 / 140
 1095 ms 19184 KB 
#include <bits/stdc++.h>
#define ll long long 
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 500100;
int n, a[maxn], d[maxn], s[maxn];

int main() {
	cin>>n;
	for(int i=1;i<=n;i++) {
		cin>>a[i];
	}
	for(int i=1;i<=n;i++) {
		cin>>d[i];
	}
	for(int i=1;i<=n;i++) {
		cin>>s[i];
	}

	sort(d, d+n);
	sort(s, s+n);
	int br = 0;
	int i=1, j=1;
	while(i <=n && j<=n) {
		if(s[j] > d[i]) {
			br++;
			j++;
			i++;
		}
		else if(s[j] <= d[i]) {
			j++;
		}
	}
	cout<<br<<"\n";
}

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 759 ms 13664 KB Output isn't correct
2 Correct 718 ms 12980 KB Output is correct
3 Correct 886 ms 16120 KB Output is correct
4 Correct 885 ms 15984 KB Output is correct
5 Incorrect 989 ms 17508 KB Output isn't correct
6 Incorrect 955 ms 16888 KB Output isn't correct
7 Incorrect 1031 ms 18268 KB Output isn't correct
8 Incorrect 922 ms 16248 KB Output isn't correct
9 Incorrect 1095 ms 19184 KB Output isn't correct
10 Incorrect 1051 ms 18240 KB Output isn't correct