제출 #62007

#제출 시각아이디문제언어결과실행 시간메모리
62007Osama_AlkhodairyFortune Telling 2 (JOI14_fortune_telling2)C++17
4 / 100
3025 ms3256 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define finish(x) return cout << x << endl, 0;

int n, q, x, y;
vector <pair <int, int> > a;
vector <int> b;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> q;
    for(int i = 0 ; i < n && cin >> x >> y ; i++)
        a.push_back(make_pair(x, y));
    for(int i = 0 ; i < q && cin >> x ; i++)
        b.push_back(x);
    ll ans = 0;
    for(auto &i : a){
        x = i.first, y = i.second;
        for(int j = 0 ; j < b.size() ; j++){
            if(b[j] >= x)
                swap(x, y);
        }
        ans += x;
    }
    cout << ans << endl;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:22:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0 ; j < b.size() ; j++){
                         ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...