| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1341618 | doantaolaaidi | Kralj (COCI16_kralj) | C++20 | 579 ms | 29816 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define AC "test"
#define foru(i, l, r) for (int i = (l); i <= (r); i++)
#define ford(i, l, r) for (int i = (l); i >= (r); i--)
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
const ll inf = 1e9 + 7;
const ll linf = 1e18 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 7;
const int base = 31;
void fastIO(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
ll mul(ll a, ll b){
a%=mod;
ll res = 0;
while (b){
if (b%2) res = (res + a)%mod;
a = (a + a)%mod;
b/=2;
}
return res;
}
ll Pow(ll a, ll b){
ll ans = 1;
while (b){
if (b % 2) ans = mul(ans, a);
a = mul(a, a);
b/=2;
}
return ans;
}
set<int> s;
int n, a[maxn], val, v[maxn], p[maxn], res;
namespace sub1{
void solve(){
foru(i, 1, n){
s.insert(v[i]);
}
res = 0;
foru(i, 1, n){
auto it = s.lower_bound(p[i]);
if (it != s.end()){
res++;
s.erase(it);
}
else{
s.erase(s.begin());
}
}
cout << res;
}
}
namespace subAC{
void solve(){
cout << n/2;
}
}
void inp(){
cin >> n;
val = 1;
foru(i, 1, n){
cin >> a[i];
val = max(val, a[i]);
}
foru(i, 1, n){
cin >> p[i];
}
foru(i, 1, n){
cin >> v[i];
}
}
int main(){
fastIO();
if (fopen(AC".inp", "r")){
freopen(AC".inp", "r", stdin);
freopen(AC".out", "w", stdout);
}
inp();
if (val == 1) sub1::solve();
else subAC::solve();
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
