제출 #668562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668562		highway_to_hell	운세 보기 2 (JOI14_fortune_telling2)	C++14	4 / 100	3065 ms	2380 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define mk make_pair
#define sz size()
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define kill(x) return cout << x << endl, void();
#define int ll
#define pii pair <int, int>
 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target ("avx2")
 
const int N = 1e6 + 5;
const int MOD = 998244353, INF = 2e9, sq = 300;
 
int a[2][N], c[N];
 
void Solve ()
{
    int n, k;
    cin >> n >> k;
    if (n > 40000 || k > 40000)
        return;
    for (int i = 0; i < n; i++)
        cin >> a[0][i] >> a[1][i];
    for (int i = 0; i < k; i++)
        cin >> c[i];
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        int wef = 0;
        for (int j = 0; j < k; j++)
            if (c[j] >= a[wef][i])
                wef = 1 - wef;
        ans += a[wef][i];
    }
    cout << ans << endl;
}
 
int32_t main ()
{
    ios::sync_with_stdio (0), cin.tie (0), cout.tie (0);
    int tt = 1;
//  cin >> tt;
    while (tt--)
        Solve ();
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65