제출 #153848

#제출 시각아이디문제언어결과실행 시간메모리
153848Ruxandra985Akcija (COCI15_akcija)C++14
80 / 80
23 ms1272 KiB
#include <cstdio> #include <algorithm> #include <set> using namespace std; int v[100010]; int main() { FILE *fin = stdin; FILE *fout = stdout; int n,i; long long sol = 0; fscanf (fin,"%d",&n); for (i=1;i<=n;i++) fscanf(fin,"%d",&v[i]); sort ( v + 1 , v + n + 1); for (i=n;i>0;i-=3){ if (i - 2>0) sol = sol + v[i] + v[i-1]; else{ sol = sol + v[i]; if (i-1>0) sol = sol + v[i-1]; } } fprintf (fout,"%lld",sol); return 0; }

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

akcija.cpp: In function 'int main()':
akcija.cpp:12:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d",&n);
     ~~~~~~~^~~~~~~~~~~~~
akcija.cpp:14:15: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf(fin,"%d",&v[i]);
         ~~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...