Pagini recente » Borderou de evaluare (job #736798) | Borderou de evaluare (job #1935743) | Borderou de evaluare (job #1930756) | Borderou de evaluare (job #2683145) | Borderou de evaluare (job #2183268)
Borderou de evaluare (job #2183268)
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 |
1 | 0ms | 1316kb | OK | 10 |
2 | 0ms | 1316kb | OK | 10 |
3 | 0ms | 1316kb | OK | 10 |
4 | 0ms | 1324kb | OK | 10 |
5 | 12ms | 1832kb | OK | 10 |
6 | 40ms | 2220kb | OK | 10 |
7 | 44ms | 2220kb | OK | 10 |
8 | 44ms | 2220kb | OK | 10 |
9 | 44ms | 2220kb | OK | 10 |
10 | 44ms | 2224kb | OK | 10 |
Punctaj total | 100 |