oj.uz

답안 #234095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234095 2020-05-23T02:56:23 Z super_j6 Exhibition (JOI19_ho_t2) C++14
0 / 100
 5 ms 384 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int maxn = 100000;
int n, m;
pi a[maxn];
int b[maxn];
vector<int> v;

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

    cin >> n >> m;
    
    for(int i = 0; i < n; i++) cin >> a[i].s >> a[i].f;
    for(int i = 0; i < m; i++) cin >> b[i];
    
    sort(a, a + n, greater<pi>());
    sort(b, b + m, greater<int>());
    
    for(int i = 0; i < n; i++){
        int it = upper_bound(v.begin(), v.end(), a[i].s, greater<int>()) - v.begin();
        if(it >= m || a[i].s > b[it]) continue;
        if(it < v.size()) v[it] = a[i].s;
        else v.push_back(a[i].s);
    }
    
    cout << v.size() << endl;
    
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:33:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(it < v.size()) v[it] = a[i].s;
            ~~~^~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Incorrect 4 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Incorrect 4 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Incorrect 4 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -