Borderou de evaluare (job #2183268)

Utilizator rares404AlShaytan - Balasescu Rares rares404 Data 22 martie 2018 22:52:50
Problema Sword Art Online Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:2:78: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] std::priority_queue<long long> pq ;int main(void){freopen("sao.in","r",stdin);freopen("sao.out","w",stdout);long long n,k,hp,a,i;scanf("%lld%lld%lld",&n,&k,&hp);for (i=1;i<=n;++i){scanf("%lld",&a),pq.push(a);hp-=a;while(!pq.empty()&&k&&hp<=0)k--,hp+=pq.top(),pq.pop();if(hp<0){printf("%lld",--i);return 0;}if(hp==0){printf("%lld",i);return 0;}}printf("%lld",n);return 0;} ^ user.cpp:2:108: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] std::priority_queue<long long> pq ;int main(void){freopen("sao.in","r",stdin);freopen("sao.out","w",stdout);long long n,k,hp,a,i;scanf("%lld%lld%lld",&n,&k,&hp);for (i=1;i<=n;++i){scanf("%lld",&a),pq.push(a);hp-=a;while(!pq.empty()&&k&&hp<=0)k--,hp+=pq.top(),pq.pop();if(hp<0){printf("%lld",--i);return 0;}if(hp==0){printf("%lld",i);return 0;}}printf("%lld",n);return 0;} ^ user.cpp:2:161: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] std::priority_queue<long long> pq ;int main(void){freopen("sao.in","r",stdin);freopen("sao.out","w",stdout);long long n,k,hp,a,i;scanf("%lld%lld%lld",&n,&k,&hp);for (i=1;i<=n;++i){scanf("%lld",&a),pq.push(a);hp-=a;while(!pq.empty()&&k&&hp<=0)k--,hp+=pq.top(),pq.pop();if(hp<0){printf("%lld",--i);return 0;}if(hp==0){printf("%lld",i);return 0;}}printf("%lld",n);return 0;} ^ user.cpp:2:208: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] std::priority_queue<long long> pq ;int main(void){freopen("sao.in","r",stdin);freopen("sao.out","w",stdout);long long n,k,hp,a,i;scanf("%lld%lld%lld",&n,&k,&hp);for (i=1;i<=n;++i){scanf("%lld",&a),pq.push(a);hp-=a;while(!pq.empty()&&k&&hp<=0)k--,hp+=pq.top(),pq.pop();if(hp<0){printf("%lld",--i);return 0;}if(hp==0){printf("%lld",i);return 0;}}printf("%lld",n);return 0;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms1316kbOK10
20ms1316kbOK10
30ms1316kbOK10
40ms1324kbOK10
512ms1832kbOK10
640ms2220kbOK10
744ms2220kbOK10
844ms2220kbOK10
944ms2220kbOK10
1044ms2224kbOK10
Punctaj total100

Ceva nu functioneaza?