oj.uz

답안 #715513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715513 2023-03-27T05:41:35 Z Koful123 Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 316 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void solve(){
	
	int n,m;
	cin >> n >> m;

	vector<pair<int,int>> v(n);
	for(auto &[x,y] : v){
		cin >> x >> y;
	}

	sort(v.begin(),v.end(),[&](auto x,auto y){
		return x.ss > y.ss;
	});
	
	vector<int> f(m);
	for(int i = 0; i < m; i++){
		cin >> f[i];
	}

	int ans = 0,p = 0,last = 0;

	sort(f.rbegin(), f.rend());
	for(int i = 0; i < m; i++){
		while(p < n && v[p].ff > f[i]){
			++p;
		}
		if(p != n){
			++ans; ++p;
		}
	}

	cout << ans << endl;
}
 
signed main(){ 

	ios::sync_with_stdio(0);
	cin.tie(0);
 
	int t = 1;
//	cin >> t;
 
	while(t--)
		solve();
 	
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'void solve()':
joi2019_ho_t2.cpp:30:20: warning: unused variable 'last' [-Wunused-variable]
   30 |  int ans = 0,p = 0,last = 0;
      |                    ^~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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