oj.uz

답안 #829970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829970 2023-08-18T16:25:14 Z DP_196 Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) (int)x.size()
#define MASK(i) ((1LL) << (i))
#define all(x) x.begin(), x.end()
#define BIT(x, i) ((x) >> (i) & (1LL))
#define dbg(...) cerr << "#" << __LINE__ << ":[" << #__VA_ARGS__ \
<< "] = [" ,DBG(__VA_ARGS__)

string to_string(const string& s) { return '"' + s + '"'; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
        cerr << to_string(h); if(sizeof...(t)) cerr << ", "; DBG(t...);
}

template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b) : 0); }
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b) : 0); }

const int MAXN = 1e5 + 6;
const int INF = 1e9;
const int MOD = 1e9 + 7;

int nPic, nFrame;
int frame_size[MAXN];

struct dat {
	int Size, Val;
} pic[MAXN];

void solve() {
	cin >> nPic >> nFrame;
	
	for (int i = 1; i <= nPic; i++) {
		cin >> pic[i].Size >> pic[i].Val;
	}
	
	for (int i = 1; i <= nFrame; i++) cin >> frame_size[i];
	
	sort(pic + 1, pic + nPic + 1, [] (dat pic1, dat pic2) {
		return pic1.Val < pic2.Val;
	});
	
	sort(frame_size + 1, frame_size + nFrame + 1);
	
	int res = 0, j = nFrame;
	
	for (int i = nPic; i >= 1; --i) {
		if (pic[i].Size <= frame_size[j]) {
			++res;
			--j;
		}
		
		if (j == 0) break;
	}
	
	cout << res;
}

#define TASK ""
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    int ntest = 1;
    //cin >> ntest;
    while (ntest--) solve();

    return 0;
}
//612

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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