Submission #1019224

#TimeUsernameProblemLanguageResultExecution timeMemory
1019224ajayTuna (COCI17_tuna)C++17
50 / 50
1 ms604 KiB
/* Ajay Jadhav */ #include <iostream> #include <cstdio> #include <algorithm> #include <deque> #include <vector> #include <cstdlib> #include <iomanip> #include <cmath> #include <queue> #include <map> #include <set> #include <stack> #include <ctime> #include <string.h> #include <climits> #include <cstring> using namespace std; #define ll long long #define pb push_back #define pii pair<int,int> #define vi vector<int> #define vii vector<pii> #define mi map<int,int> #define mii map<pii,int> #define all(a) (a).begin(),(a).end() #define x first #define y second #define sz(x) (int)x.size() #define hell 1000000007 #define rep(i,a,b) for(int i=a;i<b;i++) #define endl '\n' void solve() { int n, x; cin>>n>>x; int ans = 0; rep(i, 0, n) { int x1, x2; cin>>x1>>x2; if (abs(x1 - x2) > x) { int x3; cin>>x3; ans += x3; } else { ans += max(x1, x2); } } cout<<ans<<endl; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; // cin>>t; while (t--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...