| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1292046 | thaibeo123 | Exhibition (JOI19_ho_t2) | C++20 | 1094 ms | 592 KiB |
#include <bits/stdc++.h>
using namespace std;
#define NAME "A"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define MASK(x) (1ll << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
const int N = 2e5 + 5;
int n, m;
int s[N], v[N], c[N], id[N];
void input() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> s[i] >> v[i];
id[i] = i;
}
for (int i = 1; i <= m; i++) {
cin >> c[i];
}
sort(c + 1, c + 1 + m, greater<>());
}
void solve() {
int ans = 0;
do {
int cur = 0;
for (int i = 1; i <= n; i++) {
if (s[id[i]] > c[i]) break;
if (i >= 2 && v[id[i]] > v[id[i - 1]]) break;
cur++;
}
ans = max(ans, cur);
}while (next_permutation(id + 1, id + 1 + n));
cout << ans;
}
signed main() {
if (fopen(NAME".INP", "r")) {
freopen(NAME".INP", "r", stdin);
freopen(NAME".OUT", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int t = 1;
//cin >> t;
while (t--) {
input();
solve();
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
