Tên đăng nhập Điểm ▾ Bài tập Giới thiệu
20201 190 1
20201 190 1
20201 190 1
20201 190 1
20201 190 1
20206
mttn113nc
NC QNg Nguyen Quoc Phu
190 4
20207 190 1
20208 188 2
20209 188 3
20210 188 3
20211 188 1
20212
mttn103nc
NC BDi-CVA To Quang Nhat
187 3
20213
yueakayue
TranVuAnh
187 4

Nothing here

20214
THTA21
Phạm Quang Hoạch
187 2
20215
shiminhtien 1222
Phạm Minh Tiến
186 2

Hello, im shiminhtien and im the stupidest and brainrot coder 💩!
Contract me? I am stupid! 😭 and my friends muted me!!!

20215 186 2
20217
dzunghandsome
Đào Việt Dũng
186 1
20218 186 2
20218 185 3
20220
mttn149nc
NC NT Vo Le Ngoc Thinh
185 4
20221 185 1
20222
mttn119nc
NC DNa Vu Hoang Long
184 4
20223 184 3
20224 183 2
20225 183 2
20226
mttn012cb
CB GL Dang Xuan Bach
182 3
20226
mttn052cb
CB DNo Hoang Manh Hung
182 4
20228 182 2
20228 182 2

My name is Long

20230 182 1
20231
mttn016cb
CB BP-CBL Phan Nguyen Quoc Bao
182 4
20232
mttn173nc
NC HCMUTE Tran Canh Nam
182 3
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1

include<iostream>

include<algorithm>

using namespace std;

int main () {
int n;
cin >> n;
int a[n];
for (int i=0;i<n;i++) { cin >> a[i];
}
int dem=0;
sort (a,a+n);
int i=0,j=1,k=n-1;
while (true) {
while ((a[i]+a[j])<=a[k]) {
if (j<k-1) j++; else i++; if (i==(j-1) && j == (k-1) ) break; } if ( (a[i]+a[j])>a[k] && i<j && j < k) {
dem=dem+(k-j)*(j-i);
}
i=0;j=1;k=k-1;
if (k==1)break;
}
cout << dem;
}

20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1

NOTHING

20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 1
20233 180 2
20233 179 2
20233 179 2
20233 179 2
20262 179 4
20263 179 2
20264 178 3
20265 178 2
20265 177 2
20265
tuananh_Ngroup
Lê Xuân Tuấn Anh
177 2
20265
A_142
NGUYEN HOANG ANH TUAN
177 2
20265
A_143
HUYNH NGUYEN LAN PHUONG
177 2
20265
A_163
VAN HOANG NGAN
177 2
20265 177 2
20265 177 2
20265 177 2
20265
THTA33
Đào Mộc Lan
177 2
20265 177 2
20265 177 2

include<bits/stdc++.h>

using namespace std;

int main() {
string s;
getline(cin,s);
for (int i = 0; i < s.size(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
s[i] -= 32;

    }
        else s[i] += 32;

}

cout << s;
return 0;

}

20265 177 2
20265 177 2
20265 177 2
20265 177 2
20265 177 2
20265 177 2
20283
mttn148nc
NC QNa-LTT Tran Huynh Huu Thinh
177 3
20284 176 2
20284 176 2
20286 176 1
20287 175 1
20287 175 1
20287 175 1
20287 175 1
20287 175 1
20292
mttn032cb
CB QNa-NBK Nguyen Cao Duc
174 3
20293 174 2
20294
mttn094nc
NC BDi-LQD Nguyen Trung Nguyen
173 4
20295 173 1
20296
mttn150nc
NC DL Pham Ngoc Tho
173 4
20297 171 1
20297 171 1
20299 171 1
20299 171 1

include <bits/stdc++.h>

using namespace std;
int main ()
{
int n, m;
cin >> n >> m;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n,greater<int>());
if (a[0] == 0) {
cout << "-1";
exit(0);
}
for (int i = 0; i < n; i++) {
if (i != 0) {
sum += a[i] - 1;
} else {
sum += a[i];
}
if (sum >= m) {
cout << i + 1;
exit(0);
}
}
cout << "-1";
return 0;
}