oj.uz

답안 #548325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548325 2022-04-13T04:06:33 Z Aktan Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define int long long
#define ft first
#define sc second
const int mod=1e9+7,INF=1e17,N=1e5;

main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	
	int n,m;
	cin >> n >> m;
	vector<pair<int,int>> v;
	for(int i=0;i<n;i++){
		int a,b;
		cin >> a >> b;
		v.push_back({b,a});
	}
	sort(v.begin(),v.end());
	deque<int> s;
	for(int i=0;i<m;i++){
		int x;
		cin >> x;
		s.push_back(x);
	}
	int cnt=0;
	for(int i=0;i<n;i++){
		if(lower_bound(s.begin(),s.end(),v[i].sc)!=s.end()){
			cnt++;
			while(s.front()<v[i].sc){
				s.pop_front();
			}
			s.pop_front();
		}
	}
	cout << cnt;
}

Compilation message

joi2019_ho_t2.cpp:13:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   13 | main(){
      | ^~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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