| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1304825 | icaijy | 운세 보기 2 (JOI14_fortune_telling2) | C++20 | 1 ms | 332 KiB |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
bool cur[200005];
int main(){
int n,k;
cin>>n>>k;
for (int i=1;i<=n;i++) cin>>a[i]>>b[i];
while (k--){
int num;
cin>>num;
for (int i=1;i<=n;i++){
if (cur[i]&&b[i]<=num) cur[i]=0;
else if (!cur[i]&&a[i]<=num) cur[i]=1;
}
}
int ans=0;
for (int i=1;i<=n;i++){
if (cur[i]) ans+=b[i];
else ans+=a[i];
}
cout<<ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
