제출 #1263403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263403		tminh	Exhibition (JOI19_ho_t2)	C++20	100 / 100	35 ms	2872 KiB

joi2019_ho_t2

#include "bits/stdc++.h"
using namespace std;

#define task ""
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>


#define ep emplace_back
#define pb push_back
#define pf push_front


const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
const ll oo = 1e18;

bool START;

int n, m, ans = 0;
ll b[N];
priority_queue<pll> q;

inline void solve() {
	sort(b + 1, b + 1 + m);
	
	ans = 0;
	for (int i = m; i >= 1; --i) {
		while(!q.empty() && q.top().se > b[i]) q.pop();
		if (!q.empty()) {
			++ans;
			q.pop();
		} else break;
	}
	cout << ans;
}


inline void input() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
    	int x, y;
    	cin >> x >> y;
    	q.push(make_pair(y, x));
    }
    for (int i = 1; i <= m; ++i) cin >> b[i];
    return solve();
}
bool END;

int main() {
    if(fopen(task ".inp", "r")) {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    input();
    
    
    cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << 's' << endl;
    cerr << "Memory: " << fabs ((&END - &START)) / 1048576.0 << "MB\n";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         freopen(task ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:60:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         freopen(task ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50