oj.uz

답안 #83640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
83640 2018-11-09T14:21:23 Z Genezio Kralj (COCI16_kralj) C++14
56 / 140
 289 ms 4468 KB 
#include<bits/stdc++.h>

using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define ll long long

const int N = 500010;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9+7;

int p[N];
int v[N];
int n;


int f(int x,int y) {
	if(x==n||y==n) return 0;
	if(v[x]>p[y]) {
		//cout<<x<<" "<<y<<"\n";
		return 1+f(x+1,y+1);
	}
	return f(x+1,y);
}

int main() {
	ios::sync_with_stdio(false);
 	cin.tie(0);
    int a;
    cin>>n;
    for(int i=0;i<n;i++) {
        cin>>a;
    }
    for(int i=0;i<n;i++) {
    	cin>>p[i];
    }
    for(int i=0;i<n;i++) {
    	cin>>v[i];
    }
    sort(p,p+n);
    sort(v,v+n);
    cout<<f(0,0)<<"\n";
    return 0;
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 3520 KB Output is correct
2 Correct 207 ms 3572 KB Output is correct
3 Correct 259 ms 4288 KB Output is correct
4 Correct 268 ms 4308 KB Output is correct
5 Incorrect 274 ms 4308 KB Output isn't correct
6 Incorrect 263 ms 4308 KB Output isn't correct
7 Incorrect 274 ms 4308 KB Output isn't correct
8 Incorrect 250 ms 4308 KB Output isn't correct
9 Incorrect 289 ms 4388 KB Output isn't correct
10 Incorrect 272 ms 4468 KB Output isn't correct