제출 #321277

#제출 시각아이디문제언어결과실행 시간메모리
321277larissa_verde운세 보기 2 (JOI14_fortune_telling2)C++17
4 / 100
3039 ms2148 KiB
#include <bits/stdc++.h> #define MAXN 200000 using namespace std; struct carta{ unsigned long long frente=0,verso=0; }; carta sequencia[MAXN]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n=0,k=0; unsigned long long soma=0; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> sequencia[i].frente >> sequencia[i].verso; } while (k--) { int t=0; cin >> t; for (int i = 0; i < n; i++) { if (sequencia[i].frente <= t) swap(sequencia[i].frente, sequencia[i].verso); } } for (int i = 0; i < n; i++) { soma += sequencia[i].frente; } cout << soma; return 0; }

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

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:26:28: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   26 |    if (sequencia[i].frente <= t) swap(sequencia[i].frente, sequencia[i].verso);
      |        ~~~~~~~~~~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...