QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #399910 | #6751. Game | ericmegalovania# | AC ✓ | 18ms | 4060kb | C++20 | 1.0kb | 2024-04-26 19:26:53 | 2024-04-26 19:26:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
//#define ONLINE
#ifndef ONLINE
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) ;
#endif
using LL=long long;
using PII=pair<int,int>;
template<typename T>
inline T READ(){
T x=0; bool f=0; char c=getchar();
while(c<'0' || c>'9') f|=(c=='-'),c=getchar();
while(c>='0' && c<='9') x=x*10+c-'0',c=getchar();
return f?-x:x;
}
inline int read(){return READ<int>();}
inline LL readLL(){return READ<LL>();}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
void solve(){
int n=read();
LL ans=0;
if(n==2){
ans=min(read(),read());
}
else{
vector<int>a(n);
for(int i=0;i<n;i++){
ans+=(a[i]=read());
}
sort(a.begin(),a.end());
if(a.back()>ans/2) ans-=a.back();
else ans>>=1;
}
cout<<ans;
}
int main(){
solve();
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3572kb
input:
2 7 5
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: 0
Accepted
time: 3ms
memory: 4060kb
input:
200000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...
output:
10000050000
result:
ok 1 number(s): "10000050000"
Test #3:
score: 0
Accepted
time: 18ms
memory: 4032kb
input:
200000 861662489 745782129 265647834 549189505 370940221 849264541 392033409 728418798 198339990 783085331 609804410 358855280 393622065 778945552 40954966 557170903 603005334 323311229 205757461 358768170 600992776 530531842 353294276 91047369 31457845 490614287 352572900 59552090 942395591 4363418...
output:
50041744223374
result:
ok 1 number(s): "50041744223374"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
2 935731565 82105791
output:
82105791
result:
ok 1 number(s): "82105791"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
3 171939825 807658157 660882486
output:
820240234
result:
ok 1 number(s): "820240234"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
3 587965118 408133317 80363283
output:
488496600
result:
ok 1 number(s): "488496600"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
3 587892759 387652767 805243353
output:
890394439
result:
ok 1 number(s): "890394439"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
3 323926161 274794059 912783085
output:
598720220
result:
ok 1 number(s): "598720220"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
4 469392609 458382533 411521312 498263282
output:
918779868
result:
ok 1 number(s): "918779868"
Test #10:
score: 0
Accepted
time: 5ms
memory: 3880kb
input:
200000 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 1...
output:
19999900
result:
ok 1 number(s): "19999900"