답안 #831672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831672	2023-08-20T12:08:38 Z	OAleksa	Exhibition (JOI19_ho_t2)	C++14	0 / 100	1 ms	340 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std; 
#define int long long
const int maxn = 1e5 + 69;
int n, m, c[maxn];
pair<int, int> a[maxn];
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while(tt--) {
		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 >> c[i];
		sort(c, c + m);
		sort(a, a + n);
		int i = n - 1, j = m - 1, ans = 0;
		while(i >= 0 && j >= 0) {
			if(c[j] >= a[i].s) {
				++ans;
				--i;
			}
			--j;
		}
		cout << ans;
	}
   return 0;
}

Subtask #1

0 / 10.0

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

Subtask #2

0 / 40.0

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

Subtask #3

0 / 50.0

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