problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02784 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
long int H, N;
cin >> H >> N;
long int A[11000];
long int count = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
count += A[i];
}
if (count >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long int H, N;
cin >> H >> N;
long int A[110000];
long int count = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
count += A[i];
}
if (count >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int i, A, sum = 0;
for (i = 0; i < N; i++) {
cin >> A;
sum += A;
if (sum >= H) {
cout << "Yes" << endl;
exit(1);
}
}
if (i == N) {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int i, A, sum = 0;
for (i = 0; i < N; i++) {
cin >> A;
sum += A;
if (sum >= H) {
cout << "Yes" << endl;
exit(0);
}
}
if (i == N) {
cout << "No" << endl;
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | 1 | |
p02784 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int A[10010];
int total = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
total += A[i];
}
if (total >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int A[100010];
int total = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
total += A[i];
}
if (total >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define mod 1000000007
#define M 1000000
using namespace std;
int isprime(ll n) {
if (n == 1)
return 0;
if (n == 2 || n == 3)
return 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
void answer() {
ll n, ans = 0, m, p = 0, x;
cin >> n >> m;
ll a[n];
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m);
for (int i = 0; i < m; i++) {
ans += a[i];
}
if (ans >= n)
cout << "Yes";
else
cout << "No";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int q;
// cin>>q; while(q--)
answer();
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define mod 1000000007
#define M 1000000
using namespace std;
int isprime(ll n) {
if (n == 1)
return 0;
if (n == 2 || n == 3)
return 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
void answer() {
ll n, ans = 0, m, p = 0, x;
cin >> n >> m;
ll a[m];
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m);
for (int i = 0; i < m; i++) {
ans += a[i];
}
if (ans >= n)
cout << "Yes";
else
cout << "No";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int q;
// cin>>q; while(q--)
answer();
return 0;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 10000;
int main() {
int H, N, A[MAX_N];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
H -= A[i];
if (H <= 0) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 100000;
int main() {
int H, N, A[MAX_N];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
H -= A[i];
if (H <= 0) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | Python | Runtime Error | H, N = map(int, input().split())
total_A = sum(list(map(int, input.split())))
if H <= total_A:
print("Yes")
else:
print("No")
| H, N = map(int, input().split())
total_A = sum(list(map(int, input().split())))
if H <= total_A:
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | AttributeError: 'builtin_function_or_method' object has no attribute 'split' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02784/Python/s401209406.py", line 4, in <module>
total_A = sum(list(map(int, input.split())))
AttributeError: 'builtin_function_or_method' object has no attribute 'split'
|
p02784 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define print(n) std::cout << n << std::endl
#define print_no_indention(n) std::cout << n
using namespace std;
int main() {
int h, n;
// h = 10;
// n = 3;
cin >> h >> n;
int sum = 0;
vector<int> a;
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
sum += a.at(i);
}
if (sum >= h)
print("Yes");
else
print("No");
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define print(n) std::cout << n << std::endl
#define print_no_indention(n) std::cout << n
using namespace std;
int main() {
int h, n;
// h = 10;
// n = 3;
cin >> h >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
sum += a.at(i);
}
if (sum >= h)
print("Yes");
else
print("No");
} | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
int main() {
int h, n, sum = 0;
cin >> h >> n;
vector<int> a;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
string ans = "Yes";
if (sum < h)
ans = "No";
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
int main() {
int h, n, sum = 0;
cin >> h >> n;
vector<int> a(100001);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
string ans = "Yes";
if (sum < h)
ans = "No";
cout << ans << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | -11 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, i; // aは相手、ｂは種類
int t[100]; // 必殺のダメージ
c = 0;
cin >> a >> b;
for (auto i = 0; i < b; i++) {
cin >> t[i];
}
for (i = 0; i < b; i++) {
c = c + t[i];
}
i = a % b;
if (c >= a) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, i; // aは相手、ｂは種類
int t[1000000]; // 必殺のダメージ
c = 0;
cin >> a >> b;
for (auto i = 0; i < b; i++) {
cin >> t[i];
}
for (i = 0; i < b; i++) {
c = c + t[i];
}
i = a % b;
if (c >= a) {
cout << "Yes";
} else {
cout << "No";
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ll long long
using namespace std;
int main() {
int h, n;
cin >> h >> n;
for (int i = 0; 0 < n; i++) {
int a;
cin >> a;
h -= a;
}
if (h <= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ll long long
using namespace std;
int main() {
int h, n;
cin >> h >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
h -= a;
}
if (h <= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 34 | 35 | 34 | 35 | TLE | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int i, j;
int H;
int N;
int sum = 0;
int A[20000];
cin >> H >> N;
for (i = 0; i < N; ++i) {
cin >> A[i];
}
for (i = 0; i < N; ++i) {
sum += A[i];
}
if (sum >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int i, j;
int H;
int N;
int sum = 0;
int A[200000];
cin >> H >> N;
for (i = 0; i < N; ++i) {
cin >> A[i];
}
for (i = 0; i < N; ++i) {
sum += A[i];
}
if (sum >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Would
#define you
#define please
#define mp make_pair
#define pb push_back
#define INF 1000000000000
#define modulo 1000000007
#define ii pair<int, int>
#define int long long int
using namespace std;
map<int, int> performans;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
freopen("q.gir", "r", stdin);
freopen("q.cik", "w", stdout);
int a, b, c;
cin >> a >> b;
for (int i = 0; i < b; i++) {
cin >> c;
a -= c;
}
if (a <= 0)
cout << "Yes";
else
cout << "No";
Would you please return 0;
} | #include <bits/stdc++.h>
#define Would
#define you
#define please
#define mp make_pair
#define pb push_back
#define INF 1000000000000
#define modulo 1000000007
#define ii pair<int, int>
#define int long long int
using namespace std;
map<int, int> performans;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b;
for (int i = 0; i < b; i++) {
cin >> c;
a -= c;
}
if (a <= 0)
cout << "Yes";
else
cout << "No";
Would you please return 0;
} | delete | 15 | 17 | 15 | 15 | TLE | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, bool> Pair;
int main() {
int H, N;
int A[10000];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
H = H - A[i];
if (H > 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, bool> Pair;
int main() {
int H, N;
int A[100000];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
H = H - A[i];
if (H > 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
cout << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
int ara[a];
for (int i = 0; i < b; i++)
cin >> ara[i];
for (int i = 0; i < b; i++) {
sum += ara[i];
}
if (sum >= a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
int ara[b];
for (int i = 0; i < b; i++)
cin >> ara[i];
for (int i = 0; i < b; i++) {
sum += ara[i];
}
if (sum >= a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef long long ll;
int main() {
ll H, N;
ll A[10000];
scanf("%lld %lld", &H, &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll sum = 0;
for (int i = 0; i < N; i++) {
sum += A[i];
}
if (sum >= H) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef long long ll;
int main() {
ll H, N;
ll A[100000];
scanf("%lld %lld", &H, &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll sum = 0;
for (int i = 0; i < N; i++) {
sum += A[i];
}
if (sum >= H) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef priority_queue<int, vector<int>, greater<int>> min_pq;
const int MOD = 1e9 + 7;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define init(a) memset(a, 0, sizeof(a))
#define pb push_back
#define all(a) a.begin(), a.end()
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define rloop(i, n) for (int i = n - 1; i >= 0; i--)
#define rloops(i, s, n) for (int i = n - 1; i >= s; i--)
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
double tick() {
static clock_t oldt, newt = clock();
double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;
oldt = newt;
return diff;
}
//---------------------------------------------------------------------------------------------
int main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int h, n;
cin >> h >> n;
int a[n];
loop(i, n) { cin >> a[i]; }
lli s = 0;
loop(i, n) { s += a[i]; }
if (h <= s) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
// cout<<"Execution time : "<<tick()<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef priority_queue<int, vector<int>, greater<int>> min_pq;
const int MOD = 1e9 + 7;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define init(a) memset(a, 0, sizeof(a))
#define pb push_back
#define all(a) a.begin(), a.end()
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define rloop(i, n) for (int i = n - 1; i >= 0; i--)
#define rloops(i, s, n) for (int i = n - 1; i >= s; i--)
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
double tick() {
static clock_t oldt, newt = clock();
double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;
oldt = newt;
return diff;
}
//---------------------------------------------------------------------------------------------
int main() {
fastio;
int h, n;
cin >> h >> n;
int a[n];
loop(i, n) { cin >> a[i]; }
lli s = 0;
loop(i, n) { s += a[i]; }
if (h <= s) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
// cout<<"Execution time : "<<tick()<<"\n";
return 0;
} | delete | 37 | 41 | 37 | 37 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int h, n, a[10001];
scanf("%d%d", &h, &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
h -= a[i];
if (h <= 0) {
printf("Yes");
return 0;
}
}
printf("No");
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int h, n, a[100001];
scanf("%d%d", &h, &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
h -= a[i];
if (h <= 0) {
printf("Yes");
return 0;
}
}
printf("No");
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int act[10010];
for (int i = 0; i < N; i++) {
cin >> act[i];
}
int dmg = 0;
for (int i = 0; i < N; i++) {
dmg += act[i];
}
if (dmg >= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int act[100100];
for (int i = 0; i < N; i++) {
cin >> act[i];
}
int dmg = 0;
for (int i = 0; i < N; i++) {
dmg += act[i];
}
if (dmg >= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
vector<int> A(N);
rep(i, M) {
cin >> A.at(i);
ans += A.at(i);
}
if (ans >= N)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
vector<int> A(M);
rep(i, M) {
cin >> A.at(i);
ans += A.at(i);
}
if (ans >= N)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02784 | C++ | Runtime Error | #include <stdio.h>
int main() {
int H, N, A[9999], i;
scanf("%d%d", &H, &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
H = H - A[i];
}
if (H <= 0)
printf("Yes");
else
printf("No");
return 0;
}
| #include <stdio.h>
int main() {
int H, N, A[100005], i;
scanf("%d%d", &H, &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
H = H - A[i];
}
if (H <= 0)
printf("Yes");
else
printf("No");
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000; // 10^15
typedef long long ll;
typedef unsigned long long ull;
int ds(int n) {
int r = 0;
while (n > 0) {
r += n % 10;
n /= 10;
}
return r;
}
int main(void) {
ll h, n, a[10001];
cin >> h >> n;
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
if (h > sum)
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000; // 10^15
typedef long long ll;
typedef unsigned long long ull;
int ds(int n) {
int r = 0;
while (n > 0) {
r += n % 10;
n /= 10;
}
return r;
}
int main(void) {
ll h, n, a[100001];
cin >> h >> n;
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
if (h > sum)
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
scanf("%d %d", &H, &N);
vector<int> A(H);
for (int &x : A)
scanf("%d", &x);
long long total = 0;
for (int x : A) {
total += x;
if (total >= H) {
printf("Yes\n");
return 0;
}
}
if (total >= H) {
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
scanf("%d %d", &H, &N);
vector<int> A(N);
for (int &x : A)
scanf("%d", &x);
long long total = 0;
for (int x : A) {
total += x;
if (total >= H) {
printf("Yes\n");
return 0;
}
}
if (total >= H) {
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
using namespace std;
int main() {
long long h, nums[10004], n;
cin >> h >> n;
long long tot = 0;
rep(i, 0, n) {
cin >> nums[i];
tot += nums[i];
}
if (tot >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| #include <iostream>
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
using namespace std;
int main() {
long long h, nums[100004], n;
cin >> h >> n;
long long tot = 0;
rep(i, 0, n) {
cin >> nums[i];
tot += nums[i];
}
if (tot >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int H, n, A[10000], sum, i;
cin >> H >> n;
sum = 0;
for (i = 0; i < n; i++) {
cin >> A[i];
sum = sum + A[i];
if (sum >= H) {
cout << "Yes";
return 0;
}
}
cout << "No";
} | #include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int H, n, A[100000], sum, i;
cin >> H >> n;
sum = 0;
for (i = 0; i < n; i++) {
cin >> A[i];
sum = sum + A[i];
if (sum >= H) {
cout << "Yes";
return 0;
}
}
cout << "No";
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
using namespace std;
int main() {
int h, n;
vector<int> a(10000);
int count = 0;
cin >> h >> n;
rep(i, n) {
cin >> a.at(i);
count += a.at(i);
}
if (h - count <= 0) {
cout << "Yes" << endl;
}
if (h - count > 0) {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
using namespace std;
int main() {
int h, n;
vector<int> a(100000);
int count = 0;
cin >> h >> n;
rep(i, n) {
cin >> a.at(i);
count += a.at(i);
}
if (h - count <= 0) {
cout << "Yes" << endl;
}
if (h - count > 0) {
cout << "No" << endl;
}
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <stdio.h>
int main() {
int m, n, i, sum = 0;
scanf("%d %d", &m, &n);
int a;
for (i = 0; i < n; i++) {
scanf("%d", a);
sum = sum + a;
}
if (sum >= m)
printf("Yes");
else
printf("No");
} | #include <stdio.h>
int main() {
int m, n, i, sum = 0;
scanf("%d %d", &m, &n);
int a;
for (i = 0; i < n; i++) {
scanf("%d", &a);
sum = sum + a;
}
if (sum >= m)
printf("Yes");
else
printf("No");
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#pragma warning(disable : 4996)
unsigned long long int h, n, a[10000];
unsigned long long int b = 0;
int main() {
scanf("%llu %llu", &h, &n);
for (int i = 0; i != n; i++) {
scanf("%llu", &a[i]);
}
for (int i = 0; i != n; i++) {
b = b + a[i];
}
if (b >= h) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | #include <iostream>
#include <stdio.h>
#pragma warning(disable : 4996)
unsigned long long int h, n, a[100000];
unsigned long long int b = 0;
int main() {
scanf("%llu %llu", &h, &n);
for (int i = 0; i != n; i++) {
scanf("%llu", &a[i]);
}
for (int i = 0; i != n; i++) {
b = b + a[i];
}
if (b >= h) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02784 | C++ | Runtime Error | /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll h, n;
ll arr[10000];
cin >> h >> n;
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
if (sum >= h) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll h, n;
ll arr[100000];
cin >> h >> n;
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
if (sum >= h) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1; // Initialize result
// x=x;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x);
// y must be even now
y = y >> 1; // y = y/2
x = (x * x); // Change x to x^2
}
return res;
}
long long int power(long long int x, long long int y, long long int m) {
long long int res = 1; // Initialize result
x = x % m;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % m;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % m; // Change x to x^2
}
return res;
}
long long int gcd(long long int a, long long int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
long long int temp;
return (a * b) / gcd(a, b);
}
int main() {
long long int t = 0;
string c;
string s;
long long int n, m, o = 0, l, d = 0, i, j, p = 0, k, f;
double pie = 3.141592653589793238;
long long int MOD = 1000000007;
cin >> n >> k;
long long int a[k];
for (i = 0; i < n; i++) {
cin >> a[i];
p = p + a[i];
// b[a[i]-1]=i;
}
if (p >= n)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1; // Initialize result
// x=x;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x);
// y must be even now
y = y >> 1; // y = y/2
x = (x * x); // Change x to x^2
}
return res;
}
long long int power(long long int x, long long int y, long long int m) {
long long int res = 1; // Initialize result
x = x % m;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % m;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % m; // Change x to x^2
}
return res;
}
long long int gcd(long long int a, long long int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
long long int temp;
return (a * b) / gcd(a, b);
}
int main() {
long long int t = 0;
string c;
string s;
long long int n, m, o = 0, l, d = 0, i, j, p = 0, k, f;
double pie = 3.141592653589793238;
long long int MOD = 1000000007;
cin >> n >> k;
long long int a[k];
for (i = 0; i < k; i++) {
cin >> a[i];
p = p + a[i];
// b[a[i]-1]=i;
}
if (p >= n)
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int H, N;
scanf("%d %d", &H, &N);
int A[10005];
int sum = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
sum += A[i];
}
if (sum >= H) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
| #include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int H, N;
scanf("%d %d", &H, &N);
int A[100005];
int sum = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
sum += A[i];
}
if (sum >= H) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, N;
vector<int> vec(N);
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = accumulate(vec.begin(), vec.end(), 0);
if (H <= sum) {
string s = "Yes";
cout << "Yes";
// printf("%s\n", s);
} else {
string s = "No";
cout << "No";
// printf("%s\n", s);
}
return 0;
}
| #include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, N;
cin >> H;
cin >> N;
vector<int> vec(N + 1);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = accumulate(vec.begin(), vec.end(), 0);
if (H <= sum) {
string s = "Yes";
cout << "Yes";
// printf("%s\n", s);
} else {
string s = "No";
cout << "No";
// printf("%s\n", s);
}
return 0;
}
| replace | 8 | 11 | 8 | 11 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
int a[10010];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
// cout<<"Hの値:"<<H<<" Nの値:"<<N<<endl;
int sum = 0;
for (int i = 0; i < N; ++i) {
// cout <<"sumに"<<a[i]<<"を代入"<<endl;
sum += a[i];
}
if (sum >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
int a[100010];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
// cout<<"Hの値:"<<H<<" Nの値:"<<N<<endl;
int sum = 0;
for (int i = 0; i < N; ++i) {
// cout <<"sumに"<<a[i]<<"を代入"<<endl;
sum += a[i];
}
if (sum >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
using namespace std;
int nigarel[10001];
int main() {
int a, b, i, sum = 0;
cin >> a >> b;
for (i = 0; i < b; i++) {
cin >> nigarel[i];
sum += nigarel[i];
}
if (sum >= a)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <iostream>
using namespace std;
int nigarel[100001];
int main() {
int a, b, i, sum = 0;
cin >> a >> b;
for (i = 0; i < b; i++) {
cin >> nigarel[i];
sum += nigarel[i];
}
if (sum >= a)
cout << "Yes";
else
cout << "No";
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int h, n, a[10000];
cin >> h >> n;
rep(i, n) cin >> a[i];
string com = "No";
rep(i, n) {
h -= a[i];
if (h <= 0) {
com = "Yes";
break;
}
}
cout << com;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int h, n, a[100000];
cin >> h >> n;
rep(i, n) cin >> a[i];
string com = "No";
rep(i, n) {
h -= a[i];
if (h <= 0) {
com = "Yes";
break;
}
}
cout << com;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int H, N;
int A[10000];
int sum = 0;
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
sum += A[i];
}
cout << (sum >= H ? "Yes" : "No") << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long H, N;
long long A[100000];
long long sum = 0;
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
sum += A[i];
}
cout << (sum >= H ? "Yes" : "No") << endl;
return 0;
} | replace | 6 | 9 | 6 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll w[205];
ll v[205];
ll c[200005];
ll h[200005];
ll dp[105][100005];
typedef pair<int, int> P;
int main() {
ll h, n;
cin >> h >> n;
ll a[10005];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum >= h) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll w[205];
ll v[205];
ll c[200005];
ll h[200005];
ll dp[105][100005];
typedef pair<int, int> P;
int main() {
ll h, n;
cin >> h >> n;
ll a[100005];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum >= h) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
long long int N, M, H, W, x, i, j, k, ans, count, cost, tmp, a, b, c, d, c1,
c2, HP;
long long int S[11000];
// long long int T[11000];
// long long int U[300000];
// long long int Ssum[300000];
string T[110], TA, V, G, ans2;
bool flag;
count = 0;
ans = std::pow(10, 18);
ans = 0;
flag = false;
cin >> HP >> N;
for (i = 0; i < N; i++) {
cin >> S[i];
count += S[i];
}
// cin >> c >>d;
// count=0;
// cout << count<<endl;
if (HP <= count) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
long long int N, M, H, W, x, i, j, k, ans, count, cost, tmp, a, b, c, d, c1,
c2, HP;
long long int S[110000];
// long long int T[11000];
// long long int U[300000];
// long long int Ssum[300000];
string T[110], TA, V, G, ans2;
bool flag;
count = 0;
ans = std::pow(10, 18);
ans = 0;
flag = false;
cin >> HP >> N;
for (i = 0; i < N; i++) {
cin >> S[i];
count += S[i];
}
// cin >> c >>d;
// count=0;
// cout << count<<endl;
if (HP <= count) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
vector<int> v(h);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
vector<int> v(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int h, n, a[10000] = {}, m = 0;
cin >> h >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m += a[i];
}
if (m >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int h, n, a[100000] = {}, m = 0;
cin >> h >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m += a[i];
}
if (m >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, n, s = 0, a[10005];
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
if (s >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, n, s = 0, a[100005];
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
if (s >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(void) {
long long h, n, a[10001];
cin >> h >> n;
rep(i, n) {
cin >> a[i];
h -= a[i];
}
if (h > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(void) {
long long h, n, a[100001];
cin >> h >> n;
rep(i, n) {
cin >> a[i];
h -= a[i];
}
if (h > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define revp(i, a, b) for (int i = b; i >= a; i--)
int h, n, temp, sum = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> h >> n;
while (n--)
cin >> temp, sum += temp;
if (sum >= h)
cout << "Yes";
else
cout << "No";
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define revp(i, a, b) for (int i = b; i >= a; i--)
int h, n, temp, sum = 0;
int main() {
cin >> h >> n;
while (n--)
cin >> temp, sum += temp;
if (sum >= h)
cout << "Yes";
else
cout << "No";
}
| delete | 9 | 15 | 9 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
long long int i, a, b, arr[10000], sum;
scanf("%lld %lld", &a, &b);
sum = 0;
for (i = 0; i < b; i++) {
scanf("%lld", &arr[i]);
sum += arr[i];
}
if (sum >= a) {
printf("Yes");
} else {
printf("No");
}
printf("\n");
return 0;
}
| #include <bits/stdc++.h>
int main() {
long long int i, a, b, arr[100000], sum;
scanf("%lld %lld", &a, &b);
sum = 0;
for (i = 0; i < b; i++) {
scanf("%lld", &arr[i]);
sum += arr[i];
}
if (sum >= a) {
printf("Yes");
} else {
printf("No");
}
printf("\n");
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, d;
int c[10000];
cin >> a >> b;
d = 0;
for (int i = 0; i < b; i++) {
cin >> c[i];
}
for (int i = 0; i < b; i++) {
d = d + c[i];
}
if (d >= a)
cout << "Yes";
if (d < a)
cout << "No";
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, d;
int c[100000];
cin >> a >> b;
d = 0;
for (int i = 0; i < b; i++) {
cin >> c[i];
}
for (int i = 0; i < b; i++) {
d = d + c[i];
}
if (d >= a)
cout << "Yes";
if (d < a)
cout << "No";
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main() {
int h, n;
cin >> h >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(ALL(a));
int sum = a.at(n - 1) + a.at(n - 2);
if (sum >= h) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main() {
int h, n;
cin >> h >> n;
vector<int> a(n);
ll sum = 0;
rep(i, n) {
cin >> a.at(i);
sum += a.at(i);
}
if (sum >= h) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 12 | 15 | 12 | 17 | 0 | |
p02784 | C++ | Runtime Error | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
constexpr long long int MOD = 1000000007;
// constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
// constexpr long long int MOD = 998244353;
constexpr long double EPS = 1e-12;
// int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
vector<long long int> v(N);
for (auto &i : v)
cin >> i;
if (accumulate(v.begin(), v.end(), 0LL) < N)
cout << "No\n";
else
cout << "Yes\n";
return 0;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
constexpr long long int MOD = 1000000007;
// constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
// constexpr long long int MOD = 998244353;
constexpr long double EPS = 1e-12;
// int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
vector<long long int> v(M);
for (auto &i : v)
cin >> i;
if (accumulate(v.begin(), v.end(), 0LL) < N)
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p02784 | C++ | Runtime Error | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define YY cout << "YES"
#define NN cout << "NO"
#define EE cout << "\n"
#define ee cout << "\n"
#define ne cout << "-1"
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
#define mkt make_tuple
#define sall(v) sort(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define fo(i, n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vc vector<char>
#define vll vector<pair<ll, ll>>
#define mps map<string, ll>
#define mpc map<char, ll>
#define mpl map<ll, ll>
#define pr pair<ll, ll>
#define tpl tuple<ll, ll, ll>
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll containsDigit(ll number, ll digit) {
while (number != 0) {
int curr_digit = number % 10;
if (curr_digit == digit)
return 1;
number /= 10;
}
return 0;
}
ll soltn(ll x, ll n) {
if (x >= 0)
return x % n;
else
return n + x % n;
}
ll bin_srch(ll L[], ll N, ll item) {
ll flag = -2;
int l = 0, u = N - 1, m;
while (l <= u) {
m = (l + u) / 2;
if (item == L[m]) {
flag = m - 1;
break;
} else if (item > L[m])
l = m - 1;
else
u = m + 1;
}
return flag;
}
ll pd(ll x, ll y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
ll coda(ll n, ll d) {
ll count = 0;
while (n != 0) {
if (n % 10 == d)
count++;
n /= 10;
}
return count;
}
ll minDissame(ll a[], ll n) {
map<ll, ll> hmap;
ll minDistance = INT_MAX;
ll previousIndex = 0, currentIndex = 0;
for (ll i = 0; i < n; i++) {
if (hmap.find(a[i]) != hmap.end()) {
currentIndex = i;
previousIndex = hmap[a[i]];
minDistance = min((currentIndex - previousIndex), minDistance);
}
hmap[a[i]] = i;
}
return (minDistance == INT_MAX ? -1 : minDistance);
}
ll minDistanytwo(ll arr[], ll n, ll x, ll y) {
ll p = -1, min_dist = INT_MAX;
for (ll i = 0; i < n; i++) {
if (arr[i] == x || arr[i] == y) {
if (p != -1 && arr[i] != arr[p])
min_dist = min(min_dist, i - p);
p = i;
}
}
if (min_dist == INT_MAX)
return -1;
return min_dist;
}
ll mdls(ll x) { return max(x, -x); }
ll pow1(ll n, ll p) {
if (p == 0)
return 1;
ll x = pow1(n, p / 2);
x = (x * x);
if (p % 2 == 0)
return x;
else
return (x * n);
}
string fumn(string s) {
string p;
for (ll i = 0; i < s.length(); i++)
if (isalpha(s[i]))
p += toupper(s[i]);
return p;
}
ll turns(string S, string SS) {
ll i, cc = 0, l = S.length();
fo(i, l) {
if (S[i] != SS[i])
cc++;
}
return cc / 2;
}
ll isSubstr(string s1, string s2) {
ll M = s1.length();
ll N = s2.length();
for (ll i = 0; i <= N - M; i++) {
ll j;
for (j = 0; j < M; j++)
if (s2[i + j] != s1[j])
break;
if (j == M)
return i;
}
return -1;
}
// s2>s1;if(not) rtrn -1;
ll hhh2(unsigned ll n) {
if (n < 1)
return 0;
ll res = 1;
ll u = 0;
for (ll i = 0; i < 8 * sizeof(unsigned ll); i++) {
ll curr = 1 << i;
if (curr > n)
break;
u++;
res = curr;
}
return u;
}
ld ldgcd(ld a, ld b) { return a < 0.0001 ? b : ldgcd(fmod(b, a), a); }
void onesol(ll a, ll b, ll &x, ll &y, ll &g) {
if (!b) {
g = a;
x = 1;
y = 0;
} else {
onesol(b, a % b, y, x, g);
y -= a / b * x;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tt = 1;
// cin>>tt;
while (tt--) {
/*
211 5
31 41 59 26 53*/
ll n, m;
cin >> n >> m;
ll a[n];
ll i, s = 0;
fo(i, m) {
cin >> a[i];
s += a[i];
}
if (n <= s)
cout << "Yes";
else
cout << "No";
ee;
}
return 0;
}
| /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define YY cout << "YES"
#define NN cout << "NO"
#define EE cout << "\n"
#define ee cout << "\n"
#define ne cout << "-1"
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
#define mkt make_tuple
#define sall(v) sort(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define fo(i, n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vc vector<char>
#define vll vector<pair<ll, ll>>
#define mps map<string, ll>
#define mpc map<char, ll>
#define mpl map<ll, ll>
#define pr pair<ll, ll>
#define tpl tuple<ll, ll, ll>
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll containsDigit(ll number, ll digit) {
while (number != 0) {
int curr_digit = number % 10;
if (curr_digit == digit)
return 1;
number /= 10;
}
return 0;
}
ll soltn(ll x, ll n) {
if (x >= 0)
return x % n;
else
return n + x % n;
}
ll bin_srch(ll L[], ll N, ll item) {
ll flag = -2;
int l = 0, u = N - 1, m;
while (l <= u) {
m = (l + u) / 2;
if (item == L[m]) {
flag = m - 1;
break;
} else if (item > L[m])
l = m - 1;
else
u = m + 1;
}
return flag;
}
ll pd(ll x, ll y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
ll coda(ll n, ll d) {
ll count = 0;
while (n != 0) {
if (n % 10 == d)
count++;
n /= 10;
}
return count;
}
ll minDissame(ll a[], ll n) {
map<ll, ll> hmap;
ll minDistance = INT_MAX;
ll previousIndex = 0, currentIndex = 0;
for (ll i = 0; i < n; i++) {
if (hmap.find(a[i]) != hmap.end()) {
currentIndex = i;
previousIndex = hmap[a[i]];
minDistance = min((currentIndex - previousIndex), minDistance);
}
hmap[a[i]] = i;
}
return (minDistance == INT_MAX ? -1 : minDistance);
}
ll minDistanytwo(ll arr[], ll n, ll x, ll y) {
ll p = -1, min_dist = INT_MAX;
for (ll i = 0; i < n; i++) {
if (arr[i] == x || arr[i] == y) {
if (p != -1 && arr[i] != arr[p])
min_dist = min(min_dist, i - p);
p = i;
}
}
if (min_dist == INT_MAX)
return -1;
return min_dist;
}
ll mdls(ll x) { return max(x, -x); }
ll pow1(ll n, ll p) {
if (p == 0)
return 1;
ll x = pow1(n, p / 2);
x = (x * x);
if (p % 2 == 0)
return x;
else
return (x * n);
}
string fumn(string s) {
string p;
for (ll i = 0; i < s.length(); i++)
if (isalpha(s[i]))
p += toupper(s[i]);
return p;
}
ll turns(string S, string SS) {
ll i, cc = 0, l = S.length();
fo(i, l) {
if (S[i] != SS[i])
cc++;
}
return cc / 2;
}
ll isSubstr(string s1, string s2) {
ll M = s1.length();
ll N = s2.length();
for (ll i = 0; i <= N - M; i++) {
ll j;
for (j = 0; j < M; j++)
if (s2[i + j] != s1[j])
break;
if (j == M)
return i;
}
return -1;
}
// s2>s1;if(not) rtrn -1;
ll hhh2(unsigned ll n) {
if (n < 1)
return 0;
ll res = 1;
ll u = 0;
for (ll i = 0; i < 8 * sizeof(unsigned ll); i++) {
ll curr = 1 << i;
if (curr > n)
break;
u++;
res = curr;
}
return u;
}
ld ldgcd(ld a, ld b) { return a < 0.0001 ? b : ldgcd(fmod(b, a), a); }
void onesol(ll a, ll b, ll &x, ll &y, ll &g) {
if (!b) {
g = a;
x = 1;
y = 0;
} else {
onesol(b, a % b, y, x, g);
y -= a / b * x;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tt = 1;
// cin>>tt;
while (tt--) {
/*
211 5
31 41 59 26 53*/
ll n, m;
cin >> n >> m;
ll a[m];
ll i, s = 0;
fo(i, m) {
cin >> a[i];
s += a[i];
}
if (n <= s)
cout << "Yes";
else
cout << "No";
ee;
}
return 0;
}
| replace | 191 | 192 | 191 | 192 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int n;
int main() {
int h;
cin >> n >> h;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll adre = 0;
rep(i, n) adre += a[i];
if (h > adre)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int n;
int main() {
int h;
cin >> h >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll adre = 0;
rep(i, n) adre += a[i];
if (h > adre)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int h = 0, x = 0, o = 0;
cin >> h;
cin >> x;
vector<int> n(h);
for (int i = 0; i < x; i++) {
cin >> n[i];
o = o + n[i];
}
h = h - o;
if (h <= 0) {
cout << "Yes";
} else if (h > 0) {
cout << "No";
}
cout << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int h = 0, x = 0, o = 0;
cin >> h;
cin >> x;
vector<int> n(x);
for (int i = 0; i < x; i++) {
cin >> n[i];
o = o + n[i];
}
h = h - o;
if (h <= 0) {
cout << "Yes";
} else if (h > 0) {
cout << "No";
}
cout << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H = 0, N = 0, A[210];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum = sum + A[i];
}
if (H - sum <= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H = 0, N = 0, A[1000000];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum = sum + A[i];
}
if (H - sum <= 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
int main() {
FIO;
ll N, i, H, s = 0, A[10005];
cin >> H >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
s += A[i];
if (s >= H)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
int main() {
FIO;
ll N, i, H, s = 0, A[100000];
cin >> H >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
s += A[i];
if (s >= H)
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for (int i = start; i < (int)(end); ++i)
int a[10010];
int main() {
int h, n;
cin >> h >> n;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) h -= a[i];
if (0 < h)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for (int i = start; i < (int)(end); ++i)
int a[100010];
int main() {
int h, n;
cin >> h >> n;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) h -= a[i];
if (0 < h)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define ll long long
#define DS pair<ll, ll>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 1005;
const int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
// template<typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
ll a[N];
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
ll h, n, sum = 0;
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
puts(h <= sum ? "Yes" : "No");
return 0;
}
| #include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define ll long long
#define DS pair<ll, ll>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 3e5 + 5;
const int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
// template<typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
ll a[N];
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
ll h, n, sum = 0;
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
puts(h <= sum ? "Yes" : "No");
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 100000000000000000
#define ll long long int
#define pb push_back
#define f first
#define s second
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
int main() {
mahakal();
fast;
ll h, n;
cin >> h >> n;
ll sum = 0;
for (ll i = 0, a; i < n; i++) {
cin >> a;
sum += a;
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 100000000000000000
#define ll long long int
#define pb push_back
#define f first
#define s second
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
int main() {
// mahakal();fast;
ll h, n;
cin >> h >> n;
ll sum = 0;
for (ll i = 0, a; i < n; i++) {
cin >> a;
sum += a;
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 18 | 20 | 18 | 19 | TLE | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define BeatMeScanf \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int arr[10005];
int main() {
BeatMeScanf;
// freopen("G:/C++/in.txt", "r", stdin);
// freopen("G:/C++/out.txt", "w", stdout);
int h, n, sum = 0;
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define BeatMeScanf \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int arr[100005];
int main() {
BeatMeScanf;
// freopen("G:/C++/in.txt", "r", stdin);
// freopen("G:/C++/out.txt", "w", stdout);
int h, n, sum = 0;
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <array>
#include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H;
cin >> N;
array<int, 10000> A;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bool result = false;
for (int i = 0; i < N; i++) {
H = H - A[i];
if (H <= 0) {
result = true;
break;
}
}
if (result)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <array>
#include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H;
cin >> N;
array<int, 100000> A;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bool result = false;
for (int i = 0; i < N; i++) {
H = H - A[i];
if (H <= 0) {
result = true;
break;
}
}
if (result)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll N, i, H, s = 0, A[10005];
cin >> H >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
s += A[i];
if (s >= H)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll N, i, H, s = 0, A[100000];
cin >> H >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
s += A[i];
if (s >= H)
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | Python | Runtime Error | # ABC153
# B Common Raccoon VS Monster
h, n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if a <= s:
print("Yes")
else:
print("No")
| # ABC153
# B Common Raccoon VS Monster
h, n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if h <= s:
print("Yes")
else:
print("No")
| replace | 5 | 6 | 5 | 6 | TypeError: '<=' not supported between instances of 'list' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02784/Python/s611201002.py", line 7, in <module>
if a <= s:
TypeError: '<=' not supported between instances of 'list' and 'int'
|
p02784 | C++ | Runtime Error | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC
target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
GCC optimize("unroll-loops") #pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define int long long
// #define double ld
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
void accell() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
signed main() {
srand(time(0));
accell();
int n, a;
cin >> n >> a;
int s = 0;
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
s += b[i];
}
if (s >= a) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
}
| /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC
target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
GCC optimize("unroll-loops") #pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define int long long
// #define double ld
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
void accell() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
signed main() {
srand(time(0));
accell();
int n, a;
cin >> a >> n;
int s = 0;
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
s += b[i];
}
if (s >= a) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
}
| replace | 29 | 30 | 29 | 30 | 0 | |
p02785 | C++ | Runtime Error | /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << " -> " << (x) << endl;
#define debug2(x, y) \
cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl;
#define debug3(x, y, z) \
cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' \
<< (z) << endl;
#define debug4(x, y, z, t) \
cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' \
<< (y) << ' ' << (z) << ' ' << (t) << endl;
#define debugp(x) \
cout << #x << " -> " \
<< "(" << (x).F << ", " << (x).S << ")" << endl;
#define debuga(x, n) \
cout << #x << " -> "; \
fori(i1_da, n) { cout << (x)[i1_da] << ' '; } \
cout << endl
#define debugap(x, n) \
cout << #x << " ->\n"; \
fori(i1_dap, n) { \
cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; \
} \
cout << endl
#define debugaa(x, n, m) \
cout << #x << " ->\n"; \
fori(i1_daa, n) { \
fori(i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugav(x, n) \
cout << #x << " ->\n"; \
fori(i1_dav, n) { \
fori(i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugia(x, n) \
cout << #x << " ->\n"; \
fori(i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } \
cout << endl
#define forifrom(i, s, n) for (ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for (ll i = (n)-1; i >= (e); --i)
#define fori(i, n) forifrom(i, 0, n)
#define forir(i, n) forirto(i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD
stringstream sss;
// -----------------------------------------------------------------------
const ll maxn = 100010;
ll n, k, ar[maxn];
void MAIN() {
cin >> n >> k;
fori(i, n) cin >> ar[i];
sort(ar, ar + n);
ll s = 0;
fori(i, n - k) { s += ar[i]; }
cout << s << '\n';
}
// -----------------------------------------------------------------------
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(10);
sss << R"(
)";
MAIN();
return 0;
}
| /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << " -> " << (x) << endl;
#define debug2(x, y) \
cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl;
#define debug3(x, y, z) \
cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' \
<< (z) << endl;
#define debug4(x, y, z, t) \
cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' \
<< (y) << ' ' << (z) << ' ' << (t) << endl;
#define debugp(x) \
cout << #x << " -> " \
<< "(" << (x).F << ", " << (x).S << ")" << endl;
#define debuga(x, n) \
cout << #x << " -> "; \
fori(i1_da, n) { cout << (x)[i1_da] << ' '; } \
cout << endl
#define debugap(x, n) \
cout << #x << " ->\n"; \
fori(i1_dap, n) { \
cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; \
} \
cout << endl
#define debugaa(x, n, m) \
cout << #x << " ->\n"; \
fori(i1_daa, n) { \
fori(i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugav(x, n) \
cout << #x << " ->\n"; \
fori(i1_dav, n) { \
fori(i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugia(x, n) \
cout << #x << " ->\n"; \
fori(i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } \
cout << endl
#define forifrom(i, s, n) for (ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for (ll i = (n)-1; i >= (e); --i)
#define fori(i, n) forifrom(i, 0, n)
#define forir(i, n) forirto(i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD
stringstream sss;
// -----------------------------------------------------------------------
const ll maxn = 200010;
ll n, k, ar[maxn];
void MAIN() {
cin >> n >> k;
fori(i, n) cin >> ar[i];
sort(ar, ar + n);
ll s = 0;
fori(i, n - k) { s += ar[i]; }
cout << s << '\n';
}
// -----------------------------------------------------------------------
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(10);
sss << R"(
)";
MAIN();
return 0;
}
| replace | 97 | 98 | 97 | 98 | 0 | |
p02785 | C++ | Runtime Error | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 1000000007
#define endl '\n'
#define INF 1e18L + 1
#define mp make_pair
#define fi first
#define se second
#define debug1(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define debug3(x, y, z) \
cout << #x << " " << x << " " << #y << " " << y << " " << #z << " " << z \
<< endl;
#define debug4(x, y, z, w) \
cout << #x << " " << x << " " << #y << " " << y << " " << #z << " " << z \
<< " " << #w << " " << w << endl;
#define pb push_back
using namespace std;
template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); }
template <class T> T min(T a, T b, T c) { return min(a, min(b, c)); }
void fastio() {
ironman
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
bool prime[100005];
void SieveOfEratosthenes(ll n) // O(nloglogn)
{
memset(prime, true, sizeof(prime));
for (ll p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (ll i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
bool isPrime(ll n) // O(sqrt(n))
{
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
std::vector<ll> generatePrimeFactors(ll n) {
std::vector<ll> prime;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
prime.pb(i);
while (n % i == 0)
n = n / i;
}
}
if (n != 1)
prime.pb(n);
return prime;
}
std::vector<ll> generateFactors(ll n) {
std::vector<ll> fact;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
fact.pb(i);
if (n / i != i)
fact.pb(n / i);
// 24 - 1,2,3,4,6,8,12
}
}
fact.pb(1);
fact.pb(n);
sort(fact.begin(), fact.end());
return fact;
}
ll gcd(ll a, ll b) // O(logn)
{
if (!b)
return a;
return gcd(b, a % b);
}
ll modpow(ll x, ll n, ll m) // O(logn)// used for calculating (x^n)%m
{
if (n == 0)
return 1 % m;
ll u = modpow(x, n / 2, m) % m;
u = ((u % m) * (u % m)) % m;
if (n % 2 == 1)
u = ((u % m) * (x % m)) % m;
return u % m;
}
ll eulerstotientfunction(ll n) // O(sqrt(n))
{
ll ans = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n = n / i;
ans -= ans / i;
}
}
if (n > 1)
ans -= ans / n;
return ans;
}
ll modinverse(ll x, ll m) // O(logn)
{
return modpow(x, m - 2, m);
}
ll add(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
return (((a % m) + (b % m)) % m);
}
ll substract(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
return (((a % m) - (b % m) + m) % m);
}
ll multiply(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
return (((a % m) * (b % m)) % m);
}
ll divide(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
ll temp = modinverse(b, m);
return multiply(a, temp, m);
}
ll singlemod(ll a, ll m) {
a = ((a % m) + m) % m;
return (a % m);
}
ll ncr(ll n, ll k, ll m) {
if (k > n)
return 0;
ll res = 1;
k = min(k, n - k);
for (ll i = 1; i <= k; i++) {
res = multiply(res, n - i + 1, m);
res = divide(res, i, m);
// res *= (n-i+1);
// res/=i;
}
return singlemod(res, m);
}
ll kadaneAlgo(const std::vector<ll> &arr) {
ll size = arr.size();
ll currmax = arr[0], maxsofar = arr[0];
for (ll i = 1; i < size; i++) {
// debug2(currmax,maxsofar);
currmax = max(arr[i], currmax + arr[i]);
maxsofar = max(maxsofar, currmax);
}
return maxsofar;
}
ll getDigitSum(ll n) {
ll co = 0;
while (n > 0) {
co += n % 10;
n = n / 10;
}
return co;
}
template <class T> void printVector(const std::vector<T> arr) {
for (auto i : arr)
cout << i << " ";
cout << endl;
}
template <class T> void printArray(T arr[], ll n) {
for (ll i = 1; i <= n; i++)
cout << arr[i] << " ";
cout << endl;
}
int main() {
// fastio();
ll t = 1;
// cin >> t;
// ll cases = t;
while (t--) {
ll n, k, sum = 0;
cin >> n >> k;
std::vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr.begin(), arr.end());
for (ll i = n - 1; i >= n - k; i--)
sum -= arr[i];
cout << (sum >= 0 ? sum : 0) << endl;
// cout << "Case " << cases-t << ": " << endl;
fprintf(stderr, "Time: %d ms\n", (int)(clock() * 1000.0 / CLOCKS_PER_SEC));
}
} | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 1000000007
#define endl '\n'
#define INF 1e18L + 1
#define mp make_pair
#define fi first
#define se second
#define debug1(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define debug3(x, y, z) \
cout << #x << " " << x << " " << #y << " " << y << " " << #z << " " << z \
<< endl;
#define debug4(x, y, z, w) \
cout << #x << " " << x << " " << #y << " " << y << " " << #z << " " << z \
<< " " << #w << " " << w << endl;
#define pb push_back
using namespace std;
template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); }
template <class T> T min(T a, T b, T c) { return min(a, min(b, c)); }
void fastio() {
ironman
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
bool prime[100005];
void SieveOfEratosthenes(ll n) // O(nloglogn)
{
memset(prime, true, sizeof(prime));
for (ll p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (ll i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
bool isPrime(ll n) // O(sqrt(n))
{
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
std::vector<ll> generatePrimeFactors(ll n) {
std::vector<ll> prime;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
prime.pb(i);
while (n % i == 0)
n = n / i;
}
}
if (n != 1)
prime.pb(n);
return prime;
}
std::vector<ll> generateFactors(ll n) {
std::vector<ll> fact;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
fact.pb(i);
if (n / i != i)
fact.pb(n / i);
// 24 - 1,2,3,4,6,8,12
}
}
fact.pb(1);
fact.pb(n);
sort(fact.begin(), fact.end());
return fact;
}
ll gcd(ll a, ll b) // O(logn)
{
if (!b)
return a;
return gcd(b, a % b);
}
ll modpow(ll x, ll n, ll m) // O(logn)// used for calculating (x^n)%m
{
if (n == 0)
return 1 % m;
ll u = modpow(x, n / 2, m) % m;
u = ((u % m) * (u % m)) % m;
if (n % 2 == 1)
u = ((u % m) * (x % m)) % m;
return u % m;
}
ll eulerstotientfunction(ll n) // O(sqrt(n))
{
ll ans = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n = n / i;
ans -= ans / i;
}
}
if (n > 1)
ans -= ans / n;
return ans;
}
ll modinverse(ll x, ll m) // O(logn)
{
return modpow(x, m - 2, m);
}
ll add(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
return (((a % m) + (b % m)) % m);
}
ll substract(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
return (((a % m) - (b % m) + m) % m);
}
ll multiply(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
return (((a % m) * (b % m)) % m);
}
ll divide(ll a, ll b, ll m) {
a = ((a % m) + m) % m;
b = ((b % m) + m) % m;
ll temp = modinverse(b, m);
return multiply(a, temp, m);
}
ll singlemod(ll a, ll m) {
a = ((a % m) + m) % m;
return (a % m);
}
ll ncr(ll n, ll k, ll m) {
if (k > n)
return 0;
ll res = 1;
k = min(k, n - k);
for (ll i = 1; i <= k; i++) {
res = multiply(res, n - i + 1, m);
res = divide(res, i, m);
// res *= (n-i+1);
// res/=i;
}
return singlemod(res, m);
}
ll kadaneAlgo(const std::vector<ll> &arr) {
ll size = arr.size();
ll currmax = arr[0], maxsofar = arr[0];
for (ll i = 1; i < size; i++) {
// debug2(currmax,maxsofar);
currmax = max(arr[i], currmax + arr[i]);
maxsofar = max(maxsofar, currmax);
}
return maxsofar;
}
ll getDigitSum(ll n) {
ll co = 0;
while (n > 0) {
co += n % 10;
n = n / 10;
}
return co;
}
template <class T> void printVector(const std::vector<T> arr) {
for (auto i : arr)
cout << i << " ";
cout << endl;
}
template <class T> void printArray(T arr[], ll n) {
for (ll i = 1; i <= n; i++)
cout << arr[i] << " ";
cout << endl;
}
int main() {
// fastio();
ll t = 1;
// cin >> t;
// ll cases = t;
while (t--) {
ll n, k, sum = 0;
cin >> n >> k;
std::vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr.begin(), arr.end());
for (ll i = n - 1; i >= n - k && i >= 0; i--)
sum -= arr[i];
cout << (sum >= 0 ? sum : 0) << endl;
// cout << "Case " << cases-t << ": " << endl;
fprintf(stderr, "Time: %d ms\n", (int)(clock() * 1000.0 / CLOCKS_PER_SEC));
}
} | replace | 221 | 222 | 221 | 222 | 0 | Time: 27 ms
|
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int N, K;
int H[100001];
int main() {
cin >> N >> K;
rep(i, N) cin >> H[i];
sort(H, H + N, std::greater<int>());
ll sum = 0;
for (int i = K; i < N; i++) {
sum += H[i];
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int N, K;
int H[200001];
int main() {
cin >> N >> K;
rep(i, N) cin >> H[i];
sort(H, H + N, std::greater<int>());
ll sum = 0;
for (int i = K; i < N; i++) {
sum += H[i];
}
cout << sum << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define FOR(i, m, n) for (long long i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define RS(x) rsort(x.begin(),x,end()))
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define pob pop_back
int INF = 1e9 + 1;
int MOD = 1e9 + 7;
int main() {
long long n, k, c = 0;
cin >> n >> k;
vector<long long> h(n);
REP(i, n) { cin >> h[i]; }
SORT(h);
REP(i, k) { h[n - i - 1] = 0; }
REP(i, n) { c += h[i]; }
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define FOR(i, m, n) for (long long i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define RS(x) rsort(x.begin(),x,end()))
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define pob pop_back
int INF = 1e9 + 1;
int MOD = 1e9 + 7;
int main() {
long long n, k, c = 0;
cin >> n >> k;
if (k >= n)
k = n;
vector<long long> h(n);
REP(i, n) { cin >> h[i]; }
SORT(h);
REP(i, k) { h[n - i - 1] = 0; }
REP(i, n) { c += h[i]; }
cout << c;
} | insert | 15 | 15 | 15 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans[20005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ans[i];
}
sort(ans, ans + n);
if (n <= k) {
cout << 0 << endl;
return 0;
} else {
ll sum = 0;
for (int i = 0; i < n - k; i++)
sum += ans[i];
cout << sum << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans[200005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ans[i];
}
sort(ans, ans + n);
if (n <= k) {
cout << 0 << endl;
return 0;
} else {
ll sum = 0;
for (int i = 0; i < n - k; i++)
sum += ans[i];
cout << sum << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Time Limit Exceeded | // ConsoleApplication15.cpp : 此文件包含 "main"
// 函数。程序执行将在此处开始并结束。
//
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
int hn[200500];
int main() {
double n, k, ci;
int i;
while (cin >> n >> k) {
ci = 0;
for (i = 0; i < n; i++) {
cin >> hn[i];
}
sort(hn, hn + i, [](double a, double b) { return a > b; });
for (int p = k; p < n; p++) {
while (hn[p]) {
hn[p]--;
ci++;
}
}
cout << fixed << setprecision(0) << ci << "\n";
}
} | // ConsoleApplication15.cpp : 此文件包含 "main"
// 函数。程序执行将在此处开始并结束。
//
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
int hn[200500];
int main() {
double n, k, ci;
int i;
while (cin >> n >> k) {
ci = 0;
for (i = 0; i < n; i++) {
cin >> hn[i];
}
sort(hn, hn + i, [](double a, double b) { return a > b; });
for (int p = k; p < n; p++) {
ci += hn[p];
}
cout << fixed << setprecision(0) << ci << "\n";
}
} | replace | 20 | 24 | 20 | 21 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
long long sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[200001];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
long long sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define maxn 100010
using namespace std;
int n[maxn];
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> n[i];
}
sort(n, n + a);
LL ans = 0;
for (int i = 0; i < a - b; ++i) {
ans = ans + n[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define LL long long
#define maxn 200010
using namespace std;
int n[maxn];
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> n[i];
}
sort(n, n + a);
LL ans = 0;
for (int i = 0; i < a - b; ++i) {
ans = ans + n[i];
}
cout << ans << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (long long i = 0; i < K; i++) {
H[i] = 0;
}
long long S = 0;
for (long long i = 0; i < N; i++) {
S += H[i];
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (long long i = 0; i < K; i++) {
H[i] = 0;
if (i == N) {
break;
}
}
long long S = 0;
for (long long i = 0; i < N; i++) {
S += H[i];
}
cout << S << endl;
} | insert | 14 | 14 | 14 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 1; i <= n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
#define prique priority_queue<ll>
#define ALL(a) (a).begin(), (a).end()
const int mod = 1000000007;
const int mod2 = 998244353;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int n, int r) {
int ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans * i;
}
for (ll i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int per(int n, int r) {
r = n - r;
int sum = 1;
int i;
for (i = n; i >= r + 1; i--)
sum *= i;
return sum;
}
struct union_find {
int par[200010], size_[200010];
void init(int x) {
rep(i, x) {
par[i] = i;
size_[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (size_[x] < size_[y]) {
par[x] = y;
size_[y] += size_[x];
} else {
par[y] = x;
size_[x] += size_[y];
}
}
};
int ctoi(const char c) { return c - '0'; }
int keta(int a) { return to_string(a).size(); }
int a[100010];
signed main() {
int n, m;
cin >> n >> m;
rep(i, n) { cin >> a[i]; }
sort(a, a + n);
reverse(a, a + n);
int sum = m, ans = 0;
rep(i, n) {
if (sum > 0) {
sum--;
} else {
ans += a[i];
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 1; i <= n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
#define prique priority_queue<ll>
#define ALL(a) (a).begin(), (a).end()
const int mod = 1000000007;
const int mod2 = 998244353;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int n, int r) {
int ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans * i;
}
for (ll i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int per(int n, int r) {
r = n - r;
int sum = 1;
int i;
for (i = n; i >= r + 1; i--)
sum *= i;
return sum;
}
struct union_find {
int par[200010], size_[200010];
void init(int x) {
rep(i, x) {
par[i] = i;
size_[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (size_[x] < size_[y]) {
par[x] = y;
size_[y] += size_[x];
} else {
par[y] = x;
size_[x] += size_[y];
}
}
};
int ctoi(const char c) { return c - '0'; }
int keta(int a) { return to_string(a).size(); }
int a[200010];
signed main() {
int n, m;
cin >> n >> m;
rep(i, n) { cin >> a[i]; }
sort(a, a + n);
reverse(a, a + n);
int sum = m, ans = 0;
rep(i, n) {
if (sum > 0) {
sum--;
} else {
ans += a[i];
}
}
cout << ans << endl;
} | replace | 116 | 117 | 116 | 117 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) h[n - 1 - i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, min(k, n)) h[n - 1 - i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 自作関数
template <class T> ll llpow(T x, T n) {
ll ans = 1;
while (n--) {
ans *= x;
}
return ans;
}
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int n;
int main() {
int k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<int>());
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 自作関数
template <class T> ll llpow(T x, T n) {
ll ans = 1;
while (n--) {
ans *= x;
}
return ans;
}
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int n;
int main() {
int k;
cin >> n >> k;
if (n < k) {
cout << 0 << endl;
return 0;
}
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<int>());
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
return 0;
}
| insert | 34 | 34 | 34 | 38 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
rep(i, k) h[i] = 0;
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
k = min(n, k);
rep(i, k) h[i] = 0;
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
}
| insert | 24 | 24 | 24 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i)
cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
for (ll i = 0; i < k; ++i)
h[i] = 0;
ll sum = 0;
for (ll i = 0; i < n; ++i)
sum += h[i];
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i)
cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
if (n >= k) {
for (ll i = 0; i < k; ++i)
h[i] = 0;
} else {
for (ll i = 0; i < n; ++i)
h[i] = 0;
}
ll sum = 0;
for (ll i = 0; i < n; ++i)
sum += h[i];
cout << sum << endl;
return 0;
}
| replace | 10 | 12 | 10 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) \
Fora(iiii, a) cout << iiii << ' '; \
cout << endl;
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << ' '; \
cout << endl;
#define PrintAl(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
// #define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 1e5 + 5, mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9,
inf = 1e18 + 7;
const ll infll = 1e18 + 7;
int n, k;
int a[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
k = n - k;
ForE(i, 1, n) { cin >> a[i]; }
sort(a + 1, a + 1 + n);
int ans = 0;
ForE(i, 1, k) { ans += a[i]; }
cout << ans;
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) \
Fora(iiii, a) cout << iiii << ' '; \
cout << endl;
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << ' '; \
cout << endl;
#define PrintAl(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
// #define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 2e5 + 5, mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9,
inf = 1e18 + 7;
const ll infll = 1e18 + 7;
int n, k;
int a[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
k = n - k;
ForE(i, 1, n) { cin >> a[i]; }
sort(a + 1, a + 1 + n);
int ans = 0;
ForE(i, 1, k) { ans += a[i]; }
cout << ans;
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | replace | 85 | 86 | 85 | 86 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long a[N], ans;
int n, k;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = k + 1; i <= n; i++)
ans += a[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long a[N], ans;
int n, k;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = k + 1; i <= n; i++)
ans += a[i];
cout << ans << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | // 競技プログラミング用のテンプレート
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using ll = long long int;
using p = pair<int, int>;
using pl = pair<ll, ll>;
using v = vector<int>;
using vd = vector<double>;
using vs = vector<string>;
using vl = vector<ll>;
int main() {
int n, k;
cin >> n >> k;
vl h(n, 0);
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
rep(i, k) { h[i] = 0; }
ll c = 0;
rep(i, n) { c += h[i]; }
cout << c << endl;
}
| // 競技プログラミング用のテンプレート
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using ll = long long int;
using p = pair<int, int>;
using pl = pair<ll, ll>;
using v = vector<int>;
using vd = vector<double>;
using vs = vector<string>;
using vl = vector<ll>;
int main() {
int n, k;
cin >> n >> k;
vl h(n, 0);
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
rep(i, k) {
if (i >= n)
break;
h[i] = 0;
}
ll c = 0;
rep(i, n) { c += h[i]; }
cout << c << endl;
}
| replace | 29 | 30 | 29 | 34 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int64 N, K;
cin >> N >> K;
vector<int64> H(N);
REP(i, N) cin >> H[i];
sort(all(H), greater<int64>());
int64 sum = accumulate(all(H), 0);
REP(i, K) { sum -= H[i]; }
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int64 N, K;
cin >> N >> K;
vector<int64> H(N);
REP(i, N) cin >> H[i];
sort(all(H), greater<int64>());
int64 sum = accumulate(all(H), 0LL);
REP(i, min(K, N)) { sum -= H[i]; }
cout << sum << endl;
}
| replace | 54 | 56 | 54 | 56 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define elif else if
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define vint vector<int>
#define vvint vector<vector<int>>
#define vtr vector<string>
#define vvtr vector<vector<string>>
#define vhar vector<char>
#define vvhar vector<vector<char>>
#define mod 100000007
#define elif else if
#define str string
int digitsum(int a) {
int b = 0;
while (a) {
b += a % 10;
a /= 10;
}
return b;
}
signed main() {
int N, M, O, P = 0, c = 0, co = 0, cou = 0, minN = mod;
double D, Do;
char C, Ca;
str S, T;
cin >> N >> M;
vint A(N);
rep(0, N) {
cin >> A[i];
c += A[i];
}
sort(all(A));
rep(0, M - 1) { c -= A[A.size() - 1 - i]; }
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define elif else if
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define vint vector<int>
#define vvint vector<vector<int>>
#define vtr vector<string>
#define vvtr vector<vector<string>>
#define vhar vector<char>
#define vvhar vector<vector<char>>
#define mod 100000007
#define elif else if
#define str string
int digitsum(int a) {
int b = 0;
while (a) {
b += a % 10;
a /= 10;
}
return b;
}
signed main() {
int N, M, O, P = 0, c = 0, co = 0, cou = 0, minN = mod;
double D, Do;
char C, Ca;
str S, T;
cin >> N >> M;
vint A(N);
rep(0, N) {
cin >> A[i];
c += A[i];
}
sort(all(A));
if (N >= M)
rep(0, M) { c -= A[A.size() - 1 - i]; }
else
c = 0;
cout << c << endl;
}
| replace | 40 | 41 | 40 | 44 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v;
int move = 0;
long long s[100001];
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
v.push_back(s[i]);
sort(v.begin(), v.end());
for (int i = 0; i < n - m; i++)
move += v[i];
cout << move << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> v;
long long move = 0;
long long s;
for (int i = 0; i < n; i++) {
cin >> s;
v.push_back(s);
}
sort(v.begin(), v.end());
for (int i = 0; i < n - m; i++)
move += v[i];
cout << move << endl;
return 0;
} | replace | 5 | 12 | 5 | 12 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N, K;
long long H[20000];
long long sum = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N, greater<long long int>());
for (int i = K; i < N; i++) {
sum += H[i];
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N, K;
long long H[200000];
long long sum = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N, greater<long long int>());
for (int i = K; i < N; i++) {
sum += H[i];
}
cout << sum << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
ll H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
reverse(H, H + N);
for (int i = 0; i < K; i++) {
H[i] = 0;
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
ll H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
reverse(H, H + N);
for (int i = 0; i < min(K, N); i++) {
H[i] = 0;
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long aa[b];
long long sum = 0;
for (long long i = 0; i < a; i++) {
cin >> aa[i];
}
sort(aa, aa + a);
if (b >= a)
cout << "0" << endl;
else {
for (long long i = 0; i < a - b; i++) {
sum += aa[i];
}
cout << sum << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long aa[a];
long long sum = 0;
for (long long i = 0; i < a; i++) {
cin >> aa[i];
}
sort(aa, aa + a);
if (b >= a)
cout << "0" << endl;
else {
for (long long i = 0; i < a - b; i++) {
sum += aa[i];
}
cout << sum << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
using namespace std;
int comp(const void *a, const void *b) {
if ((*(unsigned long *)(a)) < (*(unsigned long *)(b))) {
return -1;
}
if ((*(unsigned long *)(a)) > (*(unsigned long *)(b))) {
return 1;
}
return 0;
}
int main() {
unsigned long N, K;
cin >> N >> K;
unsigned long *H;
H = (unsigned long *)malloc(N * sizeof(unsigned long));
for (unsigned long i = 0; i < N; i++) {
cin >> H[i];
}
qsort(H, N, sizeof(unsigned long), comp);
unsigned long total = 0;
for (unsigned long i = 0; i < N - K; i++) {
total += H[i];
}
cout << total << endl;
return 0;
}
| #include <cstdlib>
#include <iostream>
using namespace std;
int comp(const void *a, const void *b) {
if ((*(unsigned long *)(a)) < (*(unsigned long *)(b))) {
return -1;
}
if ((*(unsigned long *)(a)) > (*(unsigned long *)(b))) {
return 1;
}
return 0;
}
int main() {
unsigned long N, K;
cin >> N >> K;
if (N < K) {
cout << "0" << endl;
return 0;
}
unsigned long *H;
H = (unsigned long *)malloc(N * sizeof(unsigned long));
for (unsigned long i = 0; i < N; i++) {
cin >> H[i];
}
qsort(H, N, sizeof(unsigned long), comp);
unsigned long total = 0;
for (unsigned long i = 0; i < N - K; i++) {
total += H[i];
}
cout << total << endl;
return 0;
}
| insert | 15 | 15 | 15 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define INF 10000000001
#define DIM 200001
#define mod 1000000007
#define PI 3.1415926535897932384626433
#define se second
#define fi first
#define pb push_back
#define T true
#define F false
#define endl "\n"
typedef char ch;
typedef bool boll;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef set<string> sst;
typedef set<long long> sl;
typedef queue<long long> que;
typedef vector<long long> vec;
typedef map<long long, long long> mll;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, unsigned long long> pul;
ll a[100001], b, n, z, x, c, s, t;
int main() {
fast;
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], s += a[i];
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
for (int i = 1; i <= k; i++)
s -= a[i];
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define INF 10000000001
#define DIM 200001
#define mod 1000000007
#define PI 3.1415926535897932384626433
#define se second
#define fi first
#define pb push_back
#define T true
#define F false
#define endl "\n"
typedef char ch;
typedef bool boll;
typedef string st;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef set<string> sst;
typedef set<long long> sl;
typedef queue<long long> que;
typedef vector<long long> vec;
typedef map<long long, long long> mll;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, unsigned long long> pul;
ll a[200001], b, n, z, x, c, s, t;
int main() {
fast;
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], s += a[i];
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
for (int i = 1; i <= k; i++)
s -= a[i];
cout << s << endl;
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (int i = 0; i < K; i++) {
H[i] = 0;
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
if (N <= K) {
for (int i = 0; i < N; i++) {
H[i] = 0;
}
}
else {
for (int i = 0; i < K; i++) {
H[i] = 0;
}
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
ans += H[i];
}
cout << ans << endl;
} | replace | 17 | 19 | 17 | 27 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define DEBUG_VLL(vec) \
REP(sz, vec.size()) \
std::cerr << vec[sz] << (sz == vec.size() - 1 ? '\n' : ' ');
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vll h(n);
REP(i, n) cin >> h[i];
sort(ALL(h));
reverse(ALL(h));
for (int i = 0; i < k; i++)
h[i] = 0;
cout << accumulate(ALL(h), 0LL) << '\n';
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define DEBUG_VLL(vec) \
REP(sz, vec.size()) \
std::cerr << vec[sz] << (sz == vec.size() - 1 ? '\n' : ' ');
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vll h(n);
REP(i, n) cin >> h[i];
sort(ALL(h));
reverse(ALL(h));
for (int i = 0; i < min(k, n); i++)
h[i] = 0;
cout << accumulate(ALL(h), 0LL) << '\n';
return 0;
}
| replace | 63 | 64 | 63 | 64 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
for (int i = n - 1; i > n - 1 - k; i--) {
h[i] = 0;
}
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
for (int i = n - 1; i > n - 1 - k; i--) {
h[i] = 0;
if (i == 0)
break;
}
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;
} | insert | 38 | 38 | 38 | 40 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = {0, 1, 0, -1};
const int INF = 1e9;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
int guki(int a) {
if (a % 2 == 0)
return 0;
else
return 1;
}
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) {
int x = gcd(a, b);
return (a * b / x);
}
using namespace std;
ll k(ll a) {
a--;
ll ans = 0;
while (a != 0) {
ans += a;
a--;
}
return ans;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
REP(i, n) { cin >> vec[i]; }
SORT(vec);
REP(i, k) { vec[n - 1 - i] = 0; }
ll ans = 0;
REP(i, n) { ans += vec[i]; }
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = {0, 1, 0, -1};
const int INF = 1e9;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
int guki(int a) {
if (a % 2 == 0)
return 0;
else
return 1;
}
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) {
int x = gcd(a, b);
return (a * b / x);
}
using namespace std;
ll k(ll a) {
a--;
ll ans = 0;
while (a != 0) {
ans += a;
a--;
}
return ans;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
REP(i, n) { cin >> vec[i]; }
SORT(vec);
REP(i, k) {
if (i >= n) {
break;
}
vec[n - 1 - i] = 0;
}
ll ans = 0;
REP(i, n) { ans += vec[i]; }
cout << ans << endl;
}
| replace | 59 | 60 | 59 | 65 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(begin(h), end(h), greater<ll>());
rep(i, k) { h[i] = 0; }
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(begin(h), end(h), greater<ll>());
rep(i, k) {
if (i >= n)
break;
h[i] = 0;
}
ll sum = 0;
rep(i, n) sum += h[i];
cout << sum << endl;
}
| replace | 83 | 84 | 83 | 88 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k, h[1000000005], i, ans;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n, greater<int>());
for (i = k; i < n; i++) {
ans = ans + h[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, k, h[200005], i, ans;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n, greater<int>());
for (i = k; i < n; i++) {
ans = ans + h[i];
}
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
signed main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
ans += h[i];
}
sort(h.rbegin(), h.rend());
for (int i = 0; i < k; i++) {
ans -= h[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
signed main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
ans += h[i];
}
sort(h.rbegin(), h.rend());
for (int i = 0; i < min(n, k); i++) {
ans -= h[i];
}
cout << ans << endl;
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#define fori(x) for (int i = 0; i < x; ++i)
// cout << fixed << setprecision(10) << num << endl;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[110000];
fori(n) cin >> h[i];
sort(h, h + n, greater<int>());
long long i = 0, s = 0, t = 0;
for (i = 0; i < n; ++i) {
if (k > 0) {
--k;
++t;
continue;
} else {
s += h[i];
++t;
}
}
cout << i + s - t;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#define fori(x) for (int i = 0; i < x; ++i)
// cout << fixed << setprecision(10) << num << endl;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[220000];
fori(n) cin >> h[i];
sort(h, h + n, greater<int>());
long long i = 0, s = 0, t = 0;
for (i = 0; i < n; ++i) {
if (k > 0) {
--k;
++t;
continue;
} else {
s += h[i];
++t;
}
}
cout << i + s - t;
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k, h[100010];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
long long ans = 0;
for (int i = 0; i < n - k; ++i) {
ans += h[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long h[200010];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
long long ans = 0;
for (int i = 0; i < n - k; ++i) {
ans += h[i];
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
long long a[n + 1], sum = 0;
for (int i = 0; i < h; i++)
cin >> a[i];
sort(a, a + h);
for (int i = 0; i < h - n; i++)
sum += a[i];
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
long long a[h + 1], sum = 0;
for (int i = 0; i < h; i++)
cin >> a[i];
sort(a, a + h);
for (int i = 0; i < h - n; i++)
sum += a[i];
cout << sum;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(all(H));
rep(i, K) H.pop_back();
ll ans = 0;
rep(i, H.size()) ans += H[i];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(all(H));
K = min(K, N);
rep(i, K) H.pop_back();
ll ans = 0;
rep(i, H.size()) ans += H[i];
cout << ans << endl;
return 0;
}
| insert | 13 | 13 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<ll> h(n);
rep(i, n) {
cin >> h.at(i);
ans += h.at(i);
}
sort(all(h));
reverse(all(h));
rep(i, k) { ans -= h.at(i); }
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<ll> h(n);
rep(i, n) {
cin >> h.at(i);
ans += h.at(i);
}
sort(all(h));
reverse(all(h));
rep(i, min(k, n)) { ans -= h.at(i); }
cout << ans << endl;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll a[100010];
int main() {
int i, j, k;
ll H, N;
ll ans = 0;
cin >> N >> k;
for (i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
for (i = 0; i < N - k; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll a[200010];
int main() {
int i, j, k;
ll H, N;
ll ans = 0;
cin >> N >> k;
for (i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
for (i = 0; i < N - k; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, k, c = 0;
cin >> n >> k;
vector<int> a(100000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), std::greater<>());
for (int i = k; i < n; i++) {
c += a[i];
}
cout << c << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, k, c = 0;
cin >> n >> k;
vector<long long int> a(10000000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), std::greater<>());
for (int i = k; i < n; i++) {
c += a[i];
}
cout << c << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
H.push_back(a);
}
sort(H.begin(), H.end());
cout << accumulate(H.begin(), H.end() - K, 0) << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
H.push_back(a);
}
if (N < K) {
cout << 0 << endl;
} else {
sort(H.begin(), H.end());
cout << accumulate(H.begin(), H.end() - K, 0LL) << endl;
}
return 0;
} | replace | 39 | 41 | 39 | 46 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i;
cin >> n >> k;
long long int arr[100005];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (k >= n) {
printf("0\n");
} else {
long long int sum = 0;
for (i = 0; i < n - k; i++) {
sum = sum + arr[i];
}
cout << sum << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i;
cin >> n >> k;
long long int arr[200005];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (k >= n) {
printf("0\n");
} else {
long long int sum = 0;
for (i = 0; i < n - k; i++) {
sum = sum + arr[i];
}
cout << sum << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.